Hacker News Reader

In practice, computers and many programming languages are considered Turing complete because arbitrary (yet finite, obviously) amounts of memory can be added if needed. Eg. Java is considered Turing complete even if no JVM instance will ever be able to have access to infinite memory.

Theoretically, you are right. But does strict Turing completeness matter, in practice? I don't have the required knowledge to counter-argument your last point.

View on HN

If we consider the context of argument I feel that I was more on the point and you were sidetracked.

This is the context that was set up by user yters

> E.g. how could we possible write functioning code so consistently if we are limited by the halting problem for Turing machines?

You can't use known limits of Turing machines to argue that humans can do better because we can't.

Sorry, that's right.

Reply on news.ycombinator.com