Hacker News new | ask | show | jobs
by jvanderbot 694 days ago
I'm fairly certain that find + mkdir is not turing complete, it can only execute Rule 110 for so long before running out of space. But the claim applied only to the length of directory names, which I suppose are unbounded in abstract.

The limit of "Must run infinitely" will basically wreck any computer that will fit in this universe, won't it?

EDIT: Thanks for correction to rule 110

3 comments

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.
A Turing machine is a theoretical construct with an infinite tape.
In their post is a disclaimer from the author that they made a mistake in their initial proof.

https://ogiekako.vercel.app/blog/find_mkdir_tc

https://news.ycombinator.com/item?id=41115941

They also updated their proof (not saying whether it's valid or not, just updated):

https://news.ycombinator.com/item?id=41127041