News for hackers. Stuff that matters.
Re:Baba Is Turing Complete: A Sketch of a Proof by taneq on Wednesday May 15, 2019 @08:49AM (#19918844)
I guess I was hoping for a snappy term like "finite Turing-complete" or something.
Re:Baba Is Turing Complete: A Sketch of a Proof by theoh on Wednesday May 15, 2019 @01:23PM (#19921662)
The "generalizing" process is called idealization. Whenever Turing machines are mentioned, it's an idealized version of a machine that is being referred to.

Every finite physical machine is limited in different way, so it doesn't make much sense to try to lump them together. Whereas every Turing-complete machine is equivalent.