Y
Hacker News
new
|
ask
|
show
|
jobs
by
olliej
693 days ago
Run infinitely with infinite memory, so yes we the “is it Turing complete” argument is “no because finite {X}” then a Turing machine is not Turing complete because it’s impossible to actually make an infinite Turing machine.
1 comments
mort96
693 days ago
A Turing machine is a theoretical construct with an infinite tape.
link