Pages that link to "Item:Q2626083"
From MaRDI portal
The following pages link to Turing-machines and the Entscheidungsproblem (Q2626083):
Displaying 13 items.
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Tiling problems and undecidability in the cluster variation method. (Q1963548) (← links)
- Decidable subsets of open logic and an algorithm for R-calculus (Q2515454) (← links)
- Undecidability and nonperiodicity for tilings of the plane (Q2540183) (← links)
- Existential interpretation. II (Q3955341) (← links)
- Diem-Grade Logischer Entscheidungsprobleme (Q4135479) (← links)
- Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen (Q4401927) (← links)
- About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
- The Undecidability of the Domino Problem (Q5141335) (← links)
- Random Models for Evaluating Efficient Büchi Universality Checking (Q5224494) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- Turning decision procedures into disprovers (Q5505144) (← links)
- The undecidability of the Turing machine immortality problem (Q5559248) (← links)