Turing-machines and the Entscheidungsproblem

DOI10.1007/BF01470748MaRDI QIDQ2626083zbMATH OpenOpenAlexWikidataFDO

Authors 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

Cites work

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

Cited in

(15)

• Tiling problems and undecidability in the cluster variation method.
• Decidable subsets of open logic and an algorithm for R-calculus
• Undecidability and nonperiodicity for tilings of the plane
• Existential interpretation. II
• Diem-Grade Logischer Entscheidungsprobleme
• Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
• About the domino problem for subshifts on groups
• The undecidability of the domino problem
• Random models for evaluating efficient Büchi universality checking
• The developments of the concept of machine computability from 1936 to the 1960s
• Turning decision procedures into disprovers
• The undecidability of the Turing machine immortality problem
• Contributions to the domino problem: seeding, recurrence and satisfiability
• A categorical approach to reversible Turing machines and Brin-Thompson groups
• A uniform method for proving lower bounds on the computational complexity of logical theories

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2626083)