You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi there! I loved your 2019 video on "How to run any program in a Magic: the Gathering Turing Machine". I'm one of the authors of the paper you refer to, "Magic: the Gathering is Turing Complete".
When writing the original paper, I didn't manage to track down the instructions in the Cocke and Minsky 1969 paper for converting a Turing machine into a 2-tag system. So I was delighted to see you were able to both find them and implement them, along with all the other steps of your compiler. It's magnificent! Congrats on your excellent presentation of the hilarious results.
I'm contacting you because I'm actually in the process of putting together a second paper, this time on a much more easily programmable construction embedded in Magic. I'd love to make various references to your video and GitHub site, which means I have to work out what to call you :) I could just call you "cerno_b", if anonymity is important to you or that's what you want for any other reason. But if you've got a name you'd prefer me to use when you're getting cited in an academic paper, that would be great!
Also, if you're interested, I'll be looking for some pre-readers to take an initial look at the content of the sequel paper, hopefully in a couple of weeks, to check it for comprehensibility, accessibility, and any errors you might notice. Would you be interested in that? It's completely fine if not.
Let me know either way!
(And apologies for the slightly unconventional means of contacting you. I found an email address [email protected] somewhere but it doesn't seem to be receiving messages.)
Hi there! I loved your 2019 video on "How to run any program in a Magic: the Gathering Turing Machine". I'm one of the authors of the paper you refer to, "Magic: the Gathering is Turing Complete".
When writing the original paper, I didn't manage to track down the instructions in the Cocke and Minsky 1969 paper for converting a Turing machine into a 2-tag system. So I was delighted to see you were able to both find them and implement them, along with all the other steps of your compiler. It's magnificent! Congrats on your excellent presentation of the hilarious results.
I'm contacting you because I'm actually in the process of putting together a second paper, this time on a much more easily programmable construction embedded in Magic. I'd love to make various references to your video and GitHub site, which means I have to work out what to call you :) I could just call you "cerno_b", if anonymity is important to you or that's what you want for any other reason. But if you've got a name you'd prefer me to use when you're getting cited in an academic paper, that would be great!
Also, if you're interested, I'll be looking for some pre-readers to take an initial look at the content of the sequel paper, hopefully in a couple of weeks, to check it for comprehensibility, accessibility, and any errors you might notice. Would you be interested in that? It's completely fine if not.
Let me know either way!
(And apologies for the slightly unconventional means of contacting you. I found an email address [email protected] somewhere but it doesn't seem to be receiving messages.)
All the best,
Alex Churchill ([email protected] or [email protected])
The text was updated successfully, but these errors were encountered: