Ai Dreams Forum
Artificial Intelligence => General AI Discussion => Topic started by: keghn on December 16, 2017, 05:56:46 pm
-
A edge detector algorithm based on chaos, complexity, and harmony.
But fist detecting complexity and chaos.
A image is divided up into squares.
One square is selected, and the average value is found. That square is divided
into two. One of those half's is is selected. The average value is found.
I there is not difference in average values at each level then there is no complexity
in this square. And need to check the other half too.
Taking the original image that is broken into squares. A complexity value is given
to each square. A pair of squares that have different complexity numbers between
them means a edge is there.
-
The Complexity Number
Complexity number could be in a range of only 1 to 256.
A value of 1 means fraction of a fraction of a second to figure out what its. And the most minimal a mount of cpu power.
A value of 128 would mean beyond the life time of the universe. And great strain on cpu and gpu power.
Life and AGI need a fast way to deal with the easy stuff first, before wasting too much time on the too complex.
-
Could values between 128 and 256 mean negative time, a time before the Universe existed?
I'm playing these days with complementary values. I find binary encoding of negative values fascinating.
-
2^(2^1024.)
something even quantum computers cant solve. you only get one log, and that only removes one 2. u need 2 quantum computer tricks at once to get that number.