Hacker News Reader

> The complete language is a superset of the strings on existing cards. To prove the game as Turing complete, one needs to prove this language is Turing complete- not a subset of its strings.

It is not clear to me how a subset of a language could be Turing complete but not the whole language. Can you elaborate?

View on HN

Bad turn of phrase. Indeed, a Turing machine programmed in Java is a Turing machine consisting of a subset of strings in the Java language. So you are correct to doubt my claim.

I'm sorry to not have a better turn of phrase. I'll keep working on it. At this point I think the best I can do is to insist on my analogy of constructing a Turing machine out of programs written in Java, rather than writing a new program implementing a Turing machine.

Reply on news.ycombinator.com