A decision procedure using discrete geometry

DOI10.1016/0012-365X(73)90105-2zbMath0259.02029OpenAlexW2024557784MaRDI QIDQ2560235

Gabor T. Herman, Janice A. Jackowski

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90105-2

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (1)

A decision procedure using the geometry of convex sets

Cites Work

• Parallel program schemata
• The undecidability of the Turing machine immortality problem
• The unsolvability of the uniform halting problem for two state Turing machines
• The uniform halting problem for generalized one-state turing machines
• A simple solution of the uniform halting problem
• Quantificational variants on the halting problem for turing machines
• Strong Computability and Variants of the Uniform Halting Problem

This page was built for publication: A decision procedure using discrete geometry