X-machines and the halting problem: Building a super-turing machine

Abstract

We describe a novel machine model of computation, and prove that this model is capable of performing calculations beyond the capability of the standard Turing machine model. In particular, we demonstrate the ability of our model to solve the Halting problem for Turing machines. We discuss the issues involved in implementing the model as a physical device… (More)
DOI: 10.1007/BF01888233

Topics

  • Presentations referencing similar topics