Frontier between decidability and undecidability: A survey

49Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

After recalling the definition of decidability and universality, we first give a survey of results on the as exact as possible border betweeen a decidable problem and the corresponding undecidablity question in various models of discrete computation: diophantine equations, word problem, Post systems, molecular computations, register machines, neural networks, cellular automata, tiling the plane and Turing machines with planar tape. We then go on with results more specific to classical Turing machines, with a survey of results and a sketchy account on technics. We conclude by an illustration on simulating the 3x + 1 problem. © 2000 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Margenstern, M. (2000). Frontier between decidability and undecidability: A survey. Theoretical Computer Science, 231(2), 217–251. https://doi.org/10.1016/S0304-3975(99)00102-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free