2 ms·
> And no real machine can possibly be Turing complete, because they don't have infinite memory That's too pedantic. A machine that has enough memory to make i
by Dylan16807 3y ago
> And no real machine can possibly be Turing complete, because they don't have infinite memory
That's too pedantic. A machine that has enough memory to make it indistinguishable from an infinite tape should be good enough.
> or time.
I don't think infinite time is part of the definition? If it can go step by step indefinitely, that's fine.