Year: 1990
Type: article
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, and offer some tentative suggestions.
Source: Formal Aspects of Computing
DOI: 10.1007/bf01888233
Author: Mike Stannett
Institution: University of Sheffield
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2076861421
