News for hackers. Stuff that matters.

A comment on The mathematics of Magic: the Gathering (1999). Parent comment

Re:The mathematics of Magic: the Gathering (1999) by myrmi on Tuesday June 19, 2018 @04:47AM (#17344806)
> 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?

[ Parent | on HN ]
Re:The mathematics of Magic: the Gathering (1999) by YeGoblynQueenne on Thursday June 21, 2018 @10:22AM (#17365361)
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.

[ Parent | on HN ]