On the public citation graph
Solvability of the halting problem for certain classes of Turing machines
0 signed · 33 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.1090/pspum/005/0142452openalex-snapshot
Size and structure of universal Turing machines using tag systems
inferredcites →https://doi.org/10.1515/9781400882618-007openalex-snapshot
A Universal Turing Machine with Two Internal States
inferredcites →https://doi.org/10.2307/2269717openalex-snapshot
M. L. Minsky. Size and structure of universal Turing machines using Tag systems. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 229–238.
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-06170-8_1openalex-snapshot
Theoretical Computer Science: Computability, Decidability and Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_5openalex-snapshot
Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-60252-3_22openalex-snapshot
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_84openalex-snapshot
The Complexity of Small Universal Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_21openalex-snapshot
Four Small Universal Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_26openalex-snapshot
Small Semi-weakly Universal Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_24openalex-snapshot
Small Weakly Universal Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_32openalex-snapshot
The Complexity of Small Universal Turing Machines: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-36751-9_5openalex-snapshot
Turing Computability and Membrane Computing
inferred← citeshttps://doi.org/10.1007/978-3-662-47221-7_2openalex-snapshot
Tag Systems and the Complexity of Simple Programs
inferred← citeshttps://doi.org/10.1007/bf01409968openalex-snapshot
Busy beaver competition and Collatz-like problems
inferred← citeshttps://doi.org/10.1007/s00236-012-0154-2openalex-snapshot
Instruction sequence processing operators
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90038-8openalex-snapshot
Nonerasing Turing machines: a frontier between a decidable halting problem and universality
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.075openalex-snapshot
Surprising Areas in the Quest for Small Universal Devices
inferred← citeshttps://doi.org/10.1016/j.jco.2014.02.003openalex-snapshot
Wang’s B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.008openalex-snapshot
Small Turing machines and generalized busy beaver competition
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.002openalex-snapshot
Small fast universal Turing machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.051openalex-snapshot
The complexity of small universal Turing machines: A survey
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00114-6openalex-snapshot
On quasi-unilateral universal Turing machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00102-4openalex-snapshot
Frontier between decidability and undecidability: a survey
inferred← citeshttps://doi.org/10.1051/ita/1997310201591openalex-snapshot
The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved
inferred← citeshttps://doi.org/10.1109/focs.2006.58openalex-snapshot
On the time complexity of 2-tag systems and small universal Turing machines
inferred← citeshttps://doi.org/10.3233/fi-2009-0036openalex-snapshot
Four Small Universal Turing Machines
inferred← citeshttps://doi.org/10.3233/fi-2009-0039openalex-snapshot
Small Semi-Weakly Universal Turing Machines
inferred← citeshttps://doi.org/10.3233/fi-2015-1198openalex-snapshot
Semilinear Sets and Counter Machines: a Brief Survey
inferred← citeshttps://doi.org/10.3233/fi-2015-1210openalex-snapshot
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines
inferred← citeshttps://doi.org/10.48550/arxiv.1110.2230openalex-snapshot
The complexity of small universal Turing machines: a survey
inferred← citeshttps://doi.org/10.70675/d872dd1az370bz4086za674z2b1e44d14af3openalex-snapshot
Stratégies de recherches dédiées à la résolution de systèmes de contraintes sur les flottants pour la vérification de programmes
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.