On the public citation graph
Classes of Predictably Computable Functions
0 signed · 41 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.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/1993511openalex-snapshot
Decision Problems of Finite Automata Design and Related Arithmetics
inferredcites →https://doi.org/10.2307/2268308openalex-snapshot
Concatenation as a basis for arithmetic
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-29462-7_16openalex-snapshot
The P $$\mathop = \limits^? $$ NP-Problem: A View from the 1990s
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_3openalex-snapshot
Efficient First Order Functional Program Interpreter with Time Bound Certifications
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_1openalex-snapshot
The Complexity of Real Recursive Functions
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_20openalex-snapshot
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_13openalex-snapshot
The Structure of Detour Degrees
inferred← citeshttps://doi.org/10.1007/bfb0075316openalex-snapshot
Counting problems in bounded arithmetic
inferred← citeshttps://doi.org/10.1051/ita/1978120100151openalex-snapshot
Propriétés de complexité pour une famille d'algorithmes de Markov
inferred← citeshttps://doi.org/10.1090/s0002-9939-1965-0181538-0openalex-snapshot
Machine Dependence of Degrees of Difficulty
inferred← citeshttps://doi.org/10.1090/s0002-9939-1969-0250878-2openalex-snapshot
A New Hierarchy of Elementary Functions
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferred← citeshttps://doi.org/10.1090/s0002-9947-1976-0403933-6openalex-snapshot
Relativization of the theory of computational complexity
inferred← citeshttps://doi.org/10.1093/logcom/exm040openalex-snapshot
Third-Order Computation and Bounded Arithmetic
inferred← citeshttps://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferred← citeshttps://doi.org/10.1109/focs.1967.7openalex-snapshot
Classes of automata and transitive closure
inferred← citeshttps://doi.org/10.1109/mahc.1981.10005openalex-snapshot
Observations About the Development of Theoretical Computer Science
inferred← citeshttps://doi.org/10.1109/pgec.1966.264363openalex-snapshot
Continuity and Realizability of Sequence Transformations
inferred← citeshttps://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1979.27openalex-snapshot
Observations about the development of theoretical computer science
inferred← citeshttps://doi.org/10.1109/sfcs.1983.49openalex-snapshot
Randomness and the density of hard problems
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63471openalex-snapshot
Characterizations of the basic feasible functionals of finite type
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743522openalex-snapshot
A characterization of NC by tree recurrence
inferred← citeshttps://doi.org/10.1109/swat.1966.17openalex-snapshot
Real-time computation by n-dimensional iterative arrays of finite-state machines
inferred← citeshttps://doi.org/10.1109/swat.1968.33openalex-snapshot
Tape reversal complexity hierarchies
inferred← citeshttps://doi.org/10.1109/swat.1970.16openalex-snapshot
On the efficiency of programs in subrecursive formalisms
inferred← citeshttps://doi.org/10.1109/swat.1971.28openalex-snapshot
Toward a weakly invariant complexity theory
inferred← citeshttps://doi.org/10.1109/swct.1964.6openalex-snapshot
Computational complexity of recursive sequnces
inferred← citeshttps://doi.org/10.1109/synasc.2007.15openalex-snapshot
A Tool for Calculating Exponential Run-Time Properties
inferred← citeshttps://doi.org/10.1109/t-c.1969.222663openalex-snapshot
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
inferred← citeshttps://doi.org/10.1145/1008293.1008295openalex-snapshot
A characterization of log-space computable functions
inferred← citeshttps://doi.org/10.1145/321679.321691openalex-snapshot
Computational Complexity and the Existence of Complexity Gaps
inferred← citeshttps://doi.org/10.1145/800152.804909openalex-snapshot
Turing machines and the spectra of first-order formulas with equality
inferred← citeshttps://doi.org/10.1145/800161.805145openalex-snapshot
Unsolvability considerations in computational complexity
inferred← citeshttps://doi.org/10.1305/ndjfl/1093882401openalex-snapshot
On unsolvability in subrecursive classes of predicates.
inferred← citeshttps://doi.org/10.2307/1997644openalex-snapshot
Relativization of the Theory of Computational Complexity
inferred← citeshttps://doi.org/10.7146/brics.v8i46.21706openalex-snapshot
The Implicit Computational Complexity of Imperative Programming Languages
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.