Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I guess I was hoping for a snappy term like "finite Turing-complete" or something.


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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: