Ai Dreams Forum
AI Dreams => General Chat => Topic started by: Zero on August 12, 2017, 08:45:38 am

You probably know what Turing completeness is.
In computability theory, a system of datamanipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any singletaped Turing machine.
But thinking about it, since the tape is supposed to be infinite, it's a purely theoretical object. Nothing on earth has infinite memory, hence nothing is Turing complete.
Even the human brain isn't Turing complete!
:idiot2:

What if the tape is a loop... it's still infinite but requires a finite amount of memory to compute lol.
:)

You cheater ;D
The loop still has a finite number of cells... ;)