On the public citation graph
Real time computation
0 signed · 118 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.1109/tec.1962.5219459openalex-snapshot
Real-Time Computation and Recursive Functions Not Real-Time Computable
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/047134608x.w1617openalex-snapshot
Computational Complexity Theory
inferred← citeshttps://doi.org/10.1002/malq.200610030openalex-snapshot
Generalized periodicity and primitivity for words
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_176openalex-snapshot
Real time computations with restrictions on tape alphabet
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_106openalex-snapshot
On the power of real-time turing machines under varying specifications
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_27openalex-snapshot
What are the gains of the theory of algorithms
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_2openalex-snapshot
The VLSI revolution in theoretical circles
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_23openalex-snapshot
The Root of a Language and Its Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4684-8968-2_20openalex-snapshot
On the Representability of Algorithmically Decidable Predicates by Rabin Machines
inferred← citeshttps://doi.org/10.1007/978-1-4757-2606-0_6openalex-snapshot
The Incompressibility Method
inferred← citeshttps://doi.org/10.1007/978-1-4899-5630-9_20openalex-snapshot
On the Representability of Algorithmically Decidable Predicates by Rabin Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-08679-3_1openalex-snapshot
Monitoring Hyperproperties with Circuits
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_13openalex-snapshot
Computability of Real Functions with Oracle Pointer Machines Implies Real-Time Simulation of Chemical Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-0348-5879-3_12openalex-snapshot
Probleme der Komplexität in der Theorie der Algorithmen und Automaten
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_29openalex-snapshot
Theory of One Tape Linear Time Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_1openalex-snapshot
Formalizing Turing Machines
inferred← citeshttps://doi.org/10.1007/bf00289513openalex-snapshot
On non-determinancy in simple computing devices
inferred← citeshttps://doi.org/10.1007/bf01069660openalex-snapshot
A method for the analysis of turing computations. I
inferred← citeshttps://doi.org/10.1007/bf01070678openalex-snapshot
Certain estimates of the time of computations on turing machines with an input
inferred← citeshttps://doi.org/10.1007/bf01084076openalex-snapshot
Recognition of a self-crossing of a plane trajectory by a kolmogorov algorithm
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01275490openalex-snapshot
Two tapes versus one for off-line Turing machines
inferred← citeshttps://doi.org/10.1007/bf01691468openalex-snapshot
A note on dense and nondense families of complexity classes
inferred← citeshttps://doi.org/10.1007/bf01694011openalex-snapshot
Counter machines and counter languages
inferred← citeshttps://doi.org/10.1007/bf01694180openalex-snapshot
Computational complexity of random access stored program machines
inferred← citeshttps://doi.org/10.1007/bf02104744openalex-snapshot
Complexity lower bounds for machine computing models
inferred← citeshttps://doi.org/10.1007/bf02234250openalex-snapshot
Über einen Automaten mit Pufferspeicherung
inferred← citeshttps://doi.org/10.1007/bfb0015764openalex-snapshot
Lower bounds by kolmogorov-complexity
inferred← citeshttps://doi.org/10.1007/bfb0035786openalex-snapshot
Two versus one index register and modifiable versus non-modifiable programs
inferred← citeshttps://doi.org/10.1007/s00236-025-00488-wopenalex-snapshot
Deterministic real-time tree-walking-storage automata
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90125-xopenalex-snapshot
On the power of real-time two-way multihead finite automata with jumps
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90020-1openalex-snapshot
An n1.618 lower bound on the time to simulate one queue or two pushdown stores by one tape
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90179-2openalex-snapshot
Alternating real-time computations
inferred← citeshttps://doi.org/10.1016/0020-0255(69)90014-0openalex-snapshot
Automata-based computational complexity
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90042-9openalex-snapshot
Palindrome recognition in real time by a multitape turing machine
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90009-xopenalex-snapshot
An information-theoretic approach to time bounds for on-line computation
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90001-1openalex-snapshot
On two-tape real-time computation and queues
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90047-5openalex-snapshot
Simulating two pushdown stores by one tape in 0(n1.5√log n) time
inferred← citeshttps://doi.org/10.1016/0025-5564(69)90011-xopenalex-snapshot
A theoretical analysis of the effects of amygdalectomy and of organismic motivation
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90115-4openalex-snapshot
On the simulation of many storage heads by one
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90165-3openalex-snapshot
On the structure of one-tape nondeterministic turing machine time hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90211-bopenalex-snapshot
On the power of several queues
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90003-xopenalex-snapshot
Tape versus queue and stacks: The lower bounds
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90005-3openalex-snapshot
Milking the Aanderaa argument
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50011-3openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1016/b978-0-7506-6918-4.x5000-xopenalex-snapshot
Tyre and Vehicle Dynamics
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.038openalex-snapshot
A computation model with automatic functions and relations as primitive operations
inferred← citeshttps://doi.org/10.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line Turing machine computations
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)90651-6openalex-snapshot
A note on “axioms” for computational complexity and computation of finite functions
inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90843-1openalex-snapshot
On the speed of addition and multiplication on one-tape, off-line turing machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91055-5openalex-snapshot
On-line simulation of k + 1 tapes by k tapes requires nonlinear time
inferred← citeshttps://doi.org/10.1016/s0020-0255(71)80024-5openalex-snapshot
Complexity problems in real time languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(68)80027-3openalex-snapshot
Tape-reversal bounded turing machine computations
inferred← citeshttps://doi.org/10.1016/s0022-0000(70)80012-5openalex-snapshot
Time-restricted sequence generation
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80023-2openalex-snapshot
The halting problem for linear turing assemblers
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70690-1openalex-snapshot
Are Recursion Theoretic Arguments Useful in Complexity Theory?
inferred← citeshttps://doi.org/10.1016/s0076-5392(05)80054-2openalex-snapshot
Complexity: What, Why, and How
inferred← citeshttps://doi.org/10.1023/a:1021125502991openalex-snapshot
On Complexity of the Word Problem for Finitely Presented Commutative Semigroups
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
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-1969-0249212-8openalex-snapshot
On the Minimum Computation Time of Functions
inferred← citeshttps://doi.org/10.1090/s0002-9947-1985-0808746-4openalex-snapshot
Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines
inferred← citeshttps://doi.org/10.1109/focs.1965.5openalex-snapshot
Crossing sequences and off-line turing machine computations
inferred← citeshttps://doi.org/10.1109/itng.2011.167openalex-snapshot
Sublinear Space Real-Time Turing Machines Cannot Count
inferred← citeshttps://doi.org/10.1109/mahc.1981.10005openalex-snapshot
Observations About the Development of Theoretical Computer Science
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
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.1982.31openalex-snapshot
On-line simulation of k+1 tapes by k tapes requires nonlinear time
inferred← citeshttps://doi.org/10.1109/sfcs.1982.81openalex-snapshot
On-line simulation of k+1 tapes by k tapes requires nonlinear time
inferred← citeshttps://doi.org/10.1109/sfcs.1985.50openalex-snapshot
Simulating two pushdown stores by one tape in O(n1.5v) time
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.15openalex-snapshot
Limited random access turing machines
inferred← citeshttps://doi.org/10.1109/swat.1968.33openalex-snapshot
Tape reversal complexity hierarchies
inferred← citeshttps://doi.org/10.1109/swct.1964.6openalex-snapshot
Computational complexity of recursive sequnces
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.1137/0203024openalex-snapshot
Existence of Graphs with Three Spanning Trees and Given Degree Sequence
inferred← citeshttps://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferred← citeshttps://doi.org/10.1137/0213016openalex-snapshot
Two Tapes are Better than One for Nondeterministic Machines
inferred← citeshttps://doi.org/10.1142/s0129054113500329openalex-snapshot
TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
inferred← citeshttps://doi.org/10.1142/s0129054116400104openalex-snapshot
Debates with Small Transparent Quantum Verifiers
inferred← citeshttps://doi.org/10.1142/s0218196700000078openalex-snapshot
WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
inferred← citeshttps://doi.org/10.1142/s0218196799000102openalex-snapshot
COMBING NILPOTENT AND POLYCYCLIC GROUPS
inferred← citeshttps://doi.org/10.1145/195058.195428openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.1145/256303.256308openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.1145/3209108.3209194openalex-snapshot
A Theory of Register Monitors
inferred← citeshttps://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferred← citeshttps://doi.org/10.1145/321466.321475openalex-snapshot
One-way nondeterministic real-time list-storage languages
inferred← citeshttps://doi.org/10.1145/321637.321649openalex-snapshot
Deterministic Pushdown Store Machines and Real-Time Computation
inferred← citeshttps://doi.org/10.1145/321650.321661openalex-snapshot
An Overview of the Theory of Computational Complexity
inferred← citeshttps://doi.org/10.1145/365691.365962openalex-snapshot
Multi-tape and infinite-state automata—a survey
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.1145/800057.808706openalex-snapshot
Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines
inferred← citeshttps://doi.org/10.1145/800070.802171openalex-snapshot
Two tapes are better than one for nondeterministic machines
inferred← citeshttps://doi.org/10.1145/800119.803906openalex-snapshot
Intersections of linear context-free languages and reversal-bounded multipushdown machines (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800141.804685openalex-snapshot
An information-theoretic approach to time bounds for on-line computation (preliminary version)
inferred← citeshttps://doi.org/10.1145/800161.805150openalex-snapshot
Complexity problems in real time computation
inferred← citeshttps://doi.org/10.1201/9781584888239-c19openalex-snapshot
Basic Notions in Computational Complexity
inferred← citeshttps://doi.org/10.2139/ssrn.5999566openalex-snapshot
On Recursive Real-Time Uncomputable Functions
inferred← citeshttps://doi.org/10.2140/gtm.1998.1.493openalex-snapshot
Hairdressing in groups: a survey of combings and formal languages
inferred← citeshttps://doi.org/10.3929/ethz-b-000650677openalex-snapshot
On the Representational Capacity of Recurrent Neural Language Models
inferred← citeshttps://doi.org/10.4204/eptcs.388.7openalex-snapshot
Deterministic Real-Time Tree-Walking-Storage Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2613openalex-snapshot
Tight bounds for the space complexity of nonregular language recognition by real-time machines
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05115openalex-snapshot
The Power of Constraint Grammars Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04437openalex-snapshot
Ties between Parametrically Polymorphic Type Systems and Finite Control Automata
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110039openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0310046openalex-snapshot
Theory of One Tape Linear Time Turing Machines
inferred← citeshttps://doi.org/10.48550/arxiv.math/9810201openalex-snapshot
Hairdressing in groups: a survey of combings and formal 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.