There is a whole field of hypercomputation. Obviously any Turing-computable program can be run by a Turing-complete computer and a hypercomputable program can be run by a hypercomputer of the same place in the arithmetical hierarchy. The Church-Turing thesis can be expressed as stating that the universe is Turing-computable, which is a question about the universe, not just about computation. You may also be interested in Banana Scheme, which provides an short introduction to hypercomputation.
There is a whole field of hypercomputation. Obviously any Turing-computable program can be run by a Turing-complete computer and a hypercomputable program can be run by a hypercomputer of the same place in the arithmetical hierarchy. The Church-Turing thesis can be expressed as stating that the universe is Turing-computable, which is a question about the universe, not just about computation. You may also be interested in Banana Scheme, which provides an short introduction to hypercomputation.
Basilisk!
No sorry, I’m sure its not that. I would also like to know why.
What are you referring to?
Sorry that was a reply to the comment above accidentally hit the wrong “Reply” button. The comment was flippant anyway I’ve removed it.