On the public citation graph
Turing-machines and the Entscheidungsproblem
0 signed · 72 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1961.tb03975.xopenalex-snapshot
Proving Theorems by Pattern Recognition - II
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19690151302openalex-snapshot
Quantificational variants on the halting problem for turing machines
inferred← citeshttps://doi.org/10.1002/malq.19700160208openalex-snapshot
Some Properties of Recursively Inseparable Sets
inferred← citeshttps://doi.org/10.1002/malq.19880340209openalex-snapshot
Eine Bemerkung Zur Spektralen Darstellung Von ϱ‐Stelligen Aufzählbaren Und Koaufzählbaren Prädikaten Durch Ausdrücke Aus ∃∞∀ϵ∃(ϱ, 1) ∀∞∃(ϱ, 1) Und ∀∞∃(∞, 1)
inferred← citeshttps://doi.org/10.1002/malq.19890350607openalex-snapshot
Zum Reduktionstyp ∃∞∀∃∀ (0, 1) Und Zur Spektralen Darstellung ϱ‐Stelliger Aufzählbarer und Koaufzählbarer Prädikate Durch Ausdrücke Aus ∃∞∀∃∀ (ϱ, 1)
inferred← citeshttps://doi.org/10.1002/malq.19900360209openalex-snapshot
Eine Bemerkung zu spektralen Darstellungen von ϱ‐stelligen aufzählbaren und koaufzählbaren Prädikaten durch Ausdrücke aus ∃∀∃∞ und ∀∃2∀(∞, 1)
inferred← citeshttps://doi.org/10.1002/malq.19900360408openalex-snapshot
Weitere Verschärfungen zu den Reduktionstypen ∀∃∞∀(0,1), ∃∞∀3∃(∞, 1)
inferred← citeshttps://doi.org/10.1002/malq.19910371802openalex-snapshot
Reduktionstyp und Spektrale Darstellung Mit Dem Präfix
inferred← citeshttps://doi.org/10.1002/malq.19920380153openalex-snapshot
EIN NEUER BEWEIS UND EINE VERSCHÄRFUNG FÜR DEN REDUKTIONSTYP ∀∃∀∞(0, 1) MIT EINER ANWENDUNG AUF DIE SPEKTRALE DARSTELLUNG VON PRÄDIKATEN
inferred← citeshttps://doi.org/10.1002/malq.200710083openalex-snapshot
Turning decision procedures into disprovers
inferred← citeshttps://doi.org/10.1007/3-540-07805-3_8openalex-snapshot
VII. Spektralproblem und Komplexitätstheorie
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_103openalex-snapshot
Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_48openalex-snapshot
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_50openalex-snapshot
Spektralproblem and completeness of logical decision problems
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_161openalex-snapshot
Domino threads and complexity
inferred← citeshttps://doi.org/10.1007/3-540-44992-2_12openalex-snapshot
Challenges and applications for self-assembled DNA nanostructures?
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_5openalex-snapshot
A Linear Characterization of NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_13openalex-snapshot
The Work of J. Richard Büchi
inferred← citeshttps://doi.org/10.1007/978-3-030-57666-0_6openalex-snapshot
The Undecidability of the Domino Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73554-0_5openalex-snapshot
Unconventional Models of Computation Through Non-standard Logic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-11080-1_1openalex-snapshot
Basic Notions and Applications of the Theory of Decidability
inferred← citeshttps://doi.org/10.1007/978-3-642-88162-6_5openalex-snapshot
Entscheidungsproblem und Dominospiele
inferred← citeshttps://doi.org/10.1007/978-3-642-99976-5_1openalex-snapshot
An Overview of Mechanical Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-662-54069-5_8openalex-snapshot
Random Models for Evaluating Efficient Büchi Universality Checking
inferred← citeshttps://doi.org/10.1007/978-94-009-2356-0_11openalex-snapshot
Dominoes and the Aea Case of the Decision Problem
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_3openalex-snapshot
Complexity of Logical Decision Problems: An Introduction
inferred← citeshttps://doi.org/10.1007/978-94-017-9217-2_2openalex-snapshot
The Developments of the Concept of Machine Computability from 1936 to the 1960s
inferred← citeshttps://doi.org/10.1007/bf01026496openalex-snapshot
Tiling problems and undecidability in the cluster variation method
inferred← citeshttps://doi.org/10.1007/bf01068444openalex-snapshot
A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories
inferred← citeshttps://doi.org/10.1007/bf01069855openalex-snapshot
Immortality problem for post machines
inferred← citeshttps://doi.org/10.1007/bf01069942openalex-snapshot
Undecidability of the immortality problem for turing machines with three states
inferred← citeshttps://doi.org/10.1007/bf01418780openalex-snapshot
Undecidability and nonperiodicity for tilings of the plane
inferred← citeshttps://doi.org/10.1007/bf02025119openalex-snapshot
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
inferred← citeshttps://doi.org/10.1007/bf02276798openalex-snapshot
Diem-Grade Logischer Entscheidungsprobleme
inferred← citeshttps://doi.org/10.1007/bfb0079416openalex-snapshot
Recursively unsolvable algorithmic problems and related questions reexamined
inferred← citeshttps://doi.org/10.1007/s11432-014-5149-xopenalex-snapshot
Decidable subsets of open logic and an algorithm for R-calculus
inferred← citeshttps://doi.org/10.1016/0022-5193(65)90017-2openalex-snapshot
Algorithmically unsolvable problems for a cell automaton
inferred← citeshttps://doi.org/10.1016/0142-694x(89)90023-9openalex-snapshot
Construction problems as tiling puzzles
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90080-lopenalex-snapshot
A uniform method for proving lower bounds on the computational complexity of logical theories
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90014-8openalex-snapshot
Unification as a complexity measure for logic programming
inferred← citeshttps://doi.org/10.1016/b978-0-444-70396-5.50034-0openalex-snapshot
Generalizing Fuzzy Logic Probabilistic Inferences
inferred← citeshttps://doi.org/10.1016/j.device.2023.100220openalex-snapshot
Logic operations in fluidics as foundation for embedded biohybrid computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115893openalex-snapshot
A categorical approach to reversible Turing machines and Brin-Thompson groups
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70839-5openalex-snapshot
On the Decision Problem for Formulas in which all Disjunctions are Binary
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71235-7openalex-snapshot
A Simplified Proof for the Unsolvability of the Decision Problem in the Case ⋁⋀⋁
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71253-9openalex-snapshot
The Role of Finite Automata in the Development of Modern Computing Theory*
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71820-2openalex-snapshot
Decision Problems in Predicate Logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73075-5openalex-snapshot
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
inferred← citeshttps://doi.org/10.1090/dimacs/048/17openalex-snapshot
Local parallel biomolecular computation
inferred← citeshttps://doi.org/10.1093/logcom/exp072openalex-snapshot
Paraconsistent Machines and their Relation to Quantum Computing
inferred← citeshttps://doi.org/10.1093/oso/9780198537816.003.0006openalex-snapshot
A uniform method for proving lower bounds on the computational complexity of logical theories
inferred← citeshttps://doi.org/10.1109/lics.2017.8005073openalex-snapshot
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries
inferred← citeshttps://doi.org/10.1109/sfcs.1978.9openalex-snapshot
Complexity of solvable cases of the decision problem for the predicate calculus
inferred← citeshttps://doi.org/10.1137/25m1801694openalex-snapshot
Translational Tilings: Structured or Wild?
inferred← citeshttps://doi.org/10.1145/321510.321516openalex-snapshot
Properties of Programs and the First-Order Predicate Calculus
inferred← citeshttps://doi.org/10.1145/4904.4993openalex-snapshot
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870151openalex-snapshot
Nonstandard propositional logics and their application to complexity theory.
inferred← citeshttps://doi.org/10.2172/587665openalex-snapshot
Theory of periodically specified problems: Complexity and approximability
inferred← citeshttps://doi.org/10.2307/2269811openalex-snapshot
The undecidability of the Turing machine immortality problem
inferred← citeshttps://doi.org/10.70675/227b8686z1ee0z4156za2a9zc0590b828670openalex-snapshot
Subshifts of Finite Type on Groups : Emptiness and Aperiodicity
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.