News for hackers. Stuff that matters.
Re:Turing completeness bullshit by xyzzyz on Friday September 30, 2011 @08:33PM (#3059021)
Assuming that computer has finitely many states to be in because of finiteness of its memory, we can model it as a very large deterministic finite automaton. You cannot model a real computer as a LBA, because you don't necessarily have as many read-write memory as your input takes. If you think I'm wrong, please, tell me what makes you think that you can model real computers as LBAs.

There are no comments on this comment yet.