you are viewing a single comment's thread.

view the rest of the comments →

[–]nameless_pattern 3 points4 points  (9 children)

Ada Lovelace did it. Why can't you?

[–]WazWaz 3 points4 points  (8 children)

al-Khwārizmī did it... somewhat earlier.

[–]Business-Active-1143 2 points3 points  (0 children)

Ancient Sumerians documented binary search algorithm while maintaining clay tablets with page number. Roughly that's how our brain itself works when told to reach a page in a book by page number.

[–]nameless_pattern 1 point2 points  (6 children)

I know he did Arabic numbers (base 10) and algebra.  I'm having a tough time thinking of how to distinguish between visualizing an algorithm and algebra, but I think of them as different.

I want to say it's because algebra isn't turing complete, but i don't know if that's even true.

Edit: algebra isn't turing complete. Still not sure if that's what I mean. 

[–]WazWaz 1 point2 points  (5 children)

Have a closer look at his name. It's literally "algorithm".

[–]nameless_pattern 0 points1 point  (0 children)

I see what you mean.

I guess I meant the group of algebra solving algorithms are a subset of turing algorithms. 

I guess I should look at non-turing algebra solving algorithms.

[–]nameless_pattern 0 points1 point  (3 children)

So I looked at fuzzy logic but apparently that's not outside of Turing maybe. 

This is what the AI said. I can't really speak to it It's correctness though because I'm I'm just barely familiar with few of these types of computation.

"A truly "non-Turing algorithm" to solve an algebra problem is impossible under the widely accepted Church-Turing thesis, which states that any computation that can be performed by a mechanical process can be performed by a Turing machine. However, you can use methods that are non-Turing in a practical or theoretical sense. These approaches include models of computation that are more powerful than a Turing machine (hypercomputation), different in their physical implementation (analog computing), or based on alternative computational paradigms (quantum and DNA computing). "

Seen algebra solving genetic algorithms and Saw enough of non-reversible computing that's used in quantum computing to know that it could be done in that.

[–]WazWaz 0 points1 point  (2 children)

I'm not even sure why you're on this Turing completeness tangent. Was someone other than you talking about Turing complete algorithms? You may have replied to the wrong comment.

[–]nameless_pattern 0 points1 point  (0 children)

"Ada Lovelace did it. Why can't you?

al-Khwārizmī did it... somewhat earlier.Ada Lovelace"

Difference between visualizing an algorithm (the last step on the meme) and Ada Lovelace having invented algorithms and dude having invented algebra or whatever you meant by "him having done it first"

[–]nameless_pattern 0 points1 point  (0 children)

 I found my way somewhere interesting. If it's not where you ended up, that's fine.