Turing-machines and the Entscheidungsproblem

DOI10.1007/BF01470748zbMath0118.01602OpenAlexW4255472118WikidataQ92925034 ScholiaQ92925034MaRDI QIDQ2626083

J. Richard Buchi

Publication date: 1962

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/160994

zbMATH Keywords

mathematical logic

Related Items

The undecidability of the Turing machine immortality problem ⋮ About the Domino Problem for Subshifts on Groups ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Tiling problems and undecidability in the cluster variation method. ⋮ The Undecidability of the Domino Problem ⋮ Diem-Grade Logischer Entscheidungsprobleme ⋮ Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen ⋮ Decidable subsets of open logic and an algorithm for R-calculus ⋮ Random Models for Evaluating Efficient Büchi Universality Checking ⋮ Undecidability and nonperiodicity for tilings of the plane ⋮ Turning decision procedures into disprovers ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Existential interpretation. II

Cites Work

• Solvable cases of the decision problem
• A note on the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Turing-machines and the Entscheidungsproblem