On the public citation graph
Subrecursiveness: Machine-independent notions of computability in restricted time and storage
0 signed · 42 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.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line Turing machine computations
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0158822-2openalex-snapshot
Classes of predictably computable functions
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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.19830290306openalex-snapshot
DURCH SYNTAKTISCHE REKURSION DEFINIERTE KLASSEN
inferred← citeshttps://doi.org/10.1002/malq.200410010openalex-snapshot
Bounded iteration and unary functions
inferred← citeshttps://doi.org/10.1002/malq.200610056openalex-snapshot
Characterizing PSPACE with pointers
inferred← citeshttps://doi.org/10.1007/11602613_75openalex-snapshot
Recursion Theoretic Operators for Function Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-06841-4_67openalex-snapshot
Characterizations of Time-Bounded Computations by Limited Primitive Recursion
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_197openalex-snapshot
A machine independent description of complexity classes, definable by nondeterministic as well as deterministic turing machines with primitiv recursive tape or time bounds
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_49openalex-snapshot
Bounded recursion and complexity classes
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_15openalex-snapshot
A definition of the P = NP-problem in categories
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_21openalex-snapshot
Classes of functions over binary trees
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_46openalex-snapshot
On Lexicographic Termination Ordering with Space Bound Certifications
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_56openalex-snapshot
Sequential representation of primitive recursive functions, and complexity classes
inferred← citeshttps://doi.org/10.1007/3-540-60164-3_29openalex-snapshot
V-comprehensions and P space
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_81openalex-snapshot
Computation models and function algebras
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_36openalex-snapshot
A note on the relation between polynomial time functionals and Constable's class K
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_11openalex-snapshot
Axiomatizing Resource Bounds for Measure
inferred← citeshttps://doi.org/10.1007/978-3-642-67838-7_33openalex-snapshot
Das P = NP-Problem in der Kategorie der partiellen Ordnungen mit 2-stelligen Suprema
inferred← citeshttps://doi.org/10.1007/bf00288972openalex-snapshot
Ein Modell desP =N P-problems mit einer positiven L�sung
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01163281openalex-snapshot
Complexity of computable functions for a generalized storage measure
inferred← citeshttps://doi.org/10.1007/bf01629446openalex-snapshot
Machine-independent description of certain machine complexity classes
inferred← citeshttps://doi.org/10.1007/bf02835830openalex-snapshot
A time-space hierarchy between polynomial time and polynomial space
inferred← citeshttps://doi.org/10.1007/bfb0022277openalex-snapshot
Ramified recurrence and computational complexity II: Substitution and poly-space
inferred← citeshttps://doi.org/10.1007/s00037-023-00240-1openalex-snapshot
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90065-7openalex-snapshot
A recursive and a grammatical characterization of the exponential-time languages
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90141-6openalex-snapshot
Some observations on the connection between counting and recursion
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.006openalex-snapshot
Applicative theories for the polynomial hierarchy of time and its levels
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80033-0openalex-snapshot
Computation Models and Function Algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00051-5openalex-snapshot
Nondeterministic stack register machines
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00086-5openalex-snapshot
Theories with self-application and computational complexity
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.4.990openalex-snapshot
Recursion Theoretic Operators for Function Complexity Classes
inferred← citeshttps://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
inferred← citeshttps://doi.org/10.4204/eptcs.191.5openalex-snapshot
Formalizing Termination Proofs under Polynomial Quasi-interpretations
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02241openalex-snapshot
Recursion schemes, discrete differential equations and characterization of polynomial time computation
inferred← citeshttps://doi.org/10.70675/1456ce96z60b8z4870z999dz35641956685fopenalex-snapshot
Discrete-Time and Continuous-Time Systems over the Reals : Relating Complexity with Robustness, Length and Precision
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.