Turing machines were first proposed by British mathematician Alan Turing in 1936, and are a theoretical mathematical model of what it means for a system to "be a computer." At a high level, these ...

However, there's a problem with this, which I can't resolve. Anyone who's done a computing machinery course will have heard of the Halting Problem, or Self Applicability, or some variant thereof.

Turing machines are widely believed to be universal, in the sense that any computation done by any system can also be done by a Turing machine. In a new article, researchers present their work ...