I understand that much, but if there’s anything I’ve learned from computer science it’s that turing completeness can pop up in the strangest places.
I of course admit it was an off-the-cuff, intuitive thought, but the structure of the problem reminds me vaguely of the combinatorial calculus, particularly Smullyan’s Mockingbird forest.
I understand that much, but if there’s anything I’ve learned from computer science it’s that turing completeness can pop up in the strangest places.
I of course admit it was an off-the-cuff, intuitive thought, but the structure of the problem reminds me vaguely of the combinatorial calculus, particularly Smullyan’s Mockingbird forest.
This was a clever ploy to distract me with logic problems, wasn’t it?
No, but mentioning the rest of Smullyan’s books might be.