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

@article{Stannett2005XmachinesAT, title={X-machines and the halting problem: Building a super-turing machine}, author={Mike Stannett}, journal={Formal Aspects of Computing}, year={2005}, volume={2}, pages={331-341} }

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, and offer some tentative suggestions.

## 41 Citations

### A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory

- Computer ScienceSSRN Electronic Journal
- 2020

The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV, and that approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations.

### Non-Universality in Computation, and the Demise of the Church-Turing Thesis †

- Computer Science
- 2011

The focus of the work is to analyze the effect of external natural phenomena on the various components of a computational process, namely, the input phase, the calculation phase (including the algorithm and the computing agents themselves), and the output phase.

### The Church-Turing thesis

- PhilosophyCommun. ACM
- 2019

In its original form, the Church-Turing thesis concerned computation as Alan Turing and Alonzo Church used the term in 1936---human computation.

### Even Accelerating Machines are Not Universal

- Computer ScienceInt. J. Unconv. Comput.
- 2007

It is shown that there does not exist a general-purpose computer that is universal in the sense of being able to simulate any computation executable on another computer.

### THE MYTH OF UNIVERSAL COMPUTATION ∗

- Computer Science
- 2005

It is shown that the concept of a Universal Computer cannot be realized. Speci cally, instances of a computable function F are exhibited that cannot be computed on any machine U that is capable of…

### Three Counterexamples to Dispel the Myth of the Universal Computer

- Computer ScienceParallel Process. Lett.
- 2006

It is shown that the concept of a Universal Computer cannot be realized. Specifically, instances of a computable function are exhibited that cannot be computed on any machine that is capable of only…

### The Theory of X-Machines - Part 1

- Computer Science
- 2006

It is shown that the X–machine is essentially equal in computational power to the Turing machine, even though it is possible to construct hypercomputational X–machines with ease.

### The Theory of X-Machines-Part 1 Technical Report CS-05-09

- Computer Science
- 2006

It is shown that the X– machine is essentially equal in computational power to the Turing machine, even though it is possible to construct hypercomputational X– machines with ease.

### Hypercomputation and the Physical Church‐Turing Thesis

- Philosophy, Computer ScienceThe British Journal for the Philosophy of Science
- 2003

A version of the Church‐Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical,…

### Representation and Reality by Language: How to Make a Home Quantum Computer?

- Computer ScienceSSRN Electronic Journal
- 2020

A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored and the equivalence of that model to a quantum computer is demonstrated.

## References

SHOWING 1-7 OF 7 REFERENCES

### Quantum theory, the Church–Turing principle and the universal quantum computer

- Physics, PhilosophyProceedings of the Royal Society of London. A. Mathematical and Physical Sciences
- 1985

It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible…

### X-machines as a basis for dynamic system specification

- Computer ScienceSoftw. Eng. J.
- 1988

The concept of an X-machine is discussed, which is a general model of computation, with the intention of using this model in the specification of computer systems.

### Electricity and Magnetism

- HistoryNature
- 1888

THE English translation of the second volume of the valuable work of MM. Mascart and Joubert is a welcome addition to the class, none too large, of really substantial English books on electricity. We…

### Lebesgue Integration and Measure

- Mathematics
- 1973

Lebesgue integration is a technique of great power and elegance which can be applied in situations where other methods of integration fail. It is now one of the standard tools of modern mathematics,…

### The Emperor's New Mind

- Art
- 1989

Els cometes presenten en general un nucli brillant de dimensions reduides (uns quilbmetres), de forma irregular i que conte gairebe tota la massa, una cabellera al voltant del nucli i una cua (si es…

### Formal Methods in the Specification of the Human - Computer Interface

- Int . CIS J .
- 1974

### Quantum Communication Thwarts Eavesdroppers

- New Scientist,
- 1989