On the public citation graph

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.

https://doi.org/10.2307/2269717
0 signed · 51 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11493785_13openalex-snapshot
Splicing Systems for Universal Turing Machines
inferred← citeshttps://doi.org/10.1007/11786986_13openalex-snapshot
P-completeness of Cellular Automaton Rule 110
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_26openalex-snapshot
Über eine minimale universelle Turing-Maschine
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_22openalex-snapshot
New Small Universal Circular Post Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_8openalex-snapshot
Networks of Polarized Evolutionary Processors Are Computationally Complete
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-09704-6_17openalex-snapshot
Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_19openalex-snapshot
Small Universal Devices
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_10openalex-snapshot
Universality in Molecular and Cellular Computing
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-540-95885-7_20openalex-snapshot
How Redundant Is Your Universal Computation Device?
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-662-47221-7_2openalex-snapshot
Tag Systems and the Complexity of Simple Programs
inferred← citeshttps://doi.org/10.1007/bf01070520openalex-snapshot
Turing machines with three states and two symbols, and with one state and n symbols
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01163965openalex-snapshot
Solvability of the halting problem for certain classes of Turing machines
inferred← citeshttps://doi.org/10.1007/bf02234106openalex-snapshot
Eine einfache universelle Turingmaschine in ALGOL 60 Simulation
inferred← citeshttps://doi.org/10.1007/bf02476133openalex-snapshot
A programmed automaton for anesthesia control
inferred← citeshttps://doi.org/10.1007/s00236-009-0113-8openalex-snapshot
Small universal accepting hybrid networks of evolutionary processors
inferred← citeshttps://doi.org/10.1007/s10559-012-9429-4openalex-snapshot
Universal petri net
inferred← citeshttps://doi.org/10.1007/s11023-010-9193-zopenalex-snapshot
Can Machines Think? An Old Question Reformulated
inferred← citeshttps://doi.org/10.1016/0020-0255(69)90017-6openalex-snapshot
Some small, multitape universal Turing machines
inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.004openalex-snapshot
On the computational power of networks of polarized evolutionary processors
inferred← citeshttps://doi.org/10.1016/j.neunet.2016.09.001openalex-snapshot
A modular architecture for transparent computation in recurrent neural networks
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/j.tcs.2010.08.026openalex-snapshot
On the complex behavior of simple tag systems—An experimental approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.015openalex-snapshot
A simple P-complete problem and its language-theoretic representations
inferred← citeshttps://doi.org/10.1016/s0019-9958(67)90546-3openalex-snapshot
On the size of machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00077-1openalex-snapshot
Small universal Turing machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00078-3openalex-snapshot
Small deterministic Turing machines
inferred← citeshttps://doi.org/10.1080/01969727208548638openalex-snapshot
Artificial Organisms and Autonomous Cell Rules
inferred← citeshttps://doi.org/10.1080/01969727608927527openalex-snapshot
ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
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.1109/mc.2015.368openalex-snapshot
Adapting to Thrive in a New Economy of Memory Abundance
inferred← citeshttps://doi.org/10.1109/swat.1968.25openalex-snapshot
Simple computation-universal cellular spaces and self-reproduction
inferred← citeshttps://doi.org/10.1137/0208041openalex-snapshot
Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
inferred← citeshttps://doi.org/10.3233/fi-1999-381201openalex-snapshot
A Precise Version of a Time Hierarchy Theorem
inferred← citeshttps://doi.org/10.3233/fi-2010-340openalex-snapshot
Cellular Automata, Decidability and Phasespace
inferred← citeshttps://doi.org/10.3233/fi-2015-1199openalex-snapshot
Universality and Almost Decidability
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.3989/arbor.2013.764n6006openalex-snapshot
Alan Turing y los orígenes de la complejidad
inferred← citeshttps://doi.org/10.4204/eptcs.31.9openalex-snapshot
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
inferred← citeshttps://doi.org/10.48550/arxiv.1110.2230openalex-snapshot
The complexity of small universal Turing machines: a survey
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4414openalex-snapshot
Small Universal Petri Nets with Inhibitor Arcs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6700openalex-snapshot
Undecidability in binary tag systems and the Post correspondence problem for four pairs of words
inferred← citeshttps://doi.org/10.48550/arxiv.1505.01340openalex-snapshot
Universality and Almost Decidability
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.