On the public citation graph

Rudimentary interpretation of two-tape turing computation

https://doi.org/10.1007/bf01070498
0 signed · 16 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19660120120openalex-snapshot
A Basis Theorem for a Class of Two‐Way Automata
inferredcites →https://doi.org/10.1109/focs.1967.29openalex-snapshot
Real time counter machines
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.2307/2269623openalex-snapshot
A rudimentary definition of addition

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-08353-7_136openalex-snapshot
Properties of complexity classes a short survey
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_38openalex-snapshot
Rudimentary relations and Turing machines with linear alternation
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01085017openalex-snapshot
Theory of formal grammars
inferred← citeshttps://doi.org/10.1007/bfb0090174openalex-snapshot
Applications of complexity theory to Σo-definability Problems in arithmetic
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90205-5openalex-snapshot
Super-exponentials nonprimitive recursive, but rudimentary
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90010-7openalex-snapshot
Stack languages and log n space
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90257-7openalex-snapshot
The bounded arithmetic hierarchy
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70471-3openalex-snapshot
Bounded Arithmetic Formulas and Turing Machines of Constant Alternation
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00051-5openalex-snapshot
Nondeterministic stack register machines
inferred← citeshttps://doi.org/10.1023/a:1025067132637openalex-snapshot
Polynomial Computability of Certain Rudimentary Predicates
inferred← citeshttps://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
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.