On the public citation graph

Abstract Geometrical Computation: Turing-Computing Ability and Undecidability

0 signed · 49 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.1006/jcss.1995.1013openalex-snapshot
On the Computational Power of Neural Nets
inferredcites →https://doi.org/10.1007/11494645_64openalex-snapshot
Computable Analysis
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-60692-0_68openalex-snapshot
Achilles and the tortoise climbing up the arithmetical hierarchy
inferredcites →https://doi.org/10.1007/3-540-63165-8_172openalex-snapshot
Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4471-0129-1openalex-snapshot
Collision-Based Computing
inferredcites →https://doi.org/10.1007/978-1-4471-0129-1_10openalex-snapshot
Computing with Solitons: A Review and Prospectus
inferredcites →https://doi.org/10.1007/978-1-4471-0129-1_9openalex-snapshot
Signals on Cellular Automata
inferredcites →https://doi.org/10.1007/978-1-4612-0701-6openalex-snapshot
Complexity and Real Computation
inferredcites →https://doi.org/10.1007/978-1-4613-3394-4openalex-snapshot
Advances in Algorithms, Languages, and Complexity
inferredcites →https://doi.org/10.1007/978-1-4613-3394-4_11openalex-snapshot
A Survey of Continuous-Time Computation Theory
inferredcites →https://doi.org/10.1007/978-3-540-31834-7_14openalex-snapshot
Abstract Geometrical Computation for Black Hole Computation
inferredcites →https://doi.org/10.1007/bf01691105openalex-snapshot
Synchronization of interacting automata
inferredcites →https://doi.org/10.1007/bfb0023479openalex-snapshot
Intrinsic universality of a 1-dimensional reversible Cellular Automaton
inferredcites →https://doi.org/10.1007/s002240000111openalex-snapshot
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems
inferredcites →https://doi.org/10.1016/0304-3975(90)90160-jopenalex-snapshot
Reversible parallel computation: An evolving space-model
inferredcites →https://doi.org/10.1016/0304-3975(94)00147-bopenalex-snapshot
Universal computation and other capabilities of hybrid and continuous dynamical systems
inferredcites →https://doi.org/10.1016/0304-3975(95)00248-0openalex-snapshot
Recursion theory on the reals and continuous-time computation
inferredcites →https://doi.org/10.1016/s0167-2789(01)00252-4openalex-snapshot
Upper bound on the products of particle interactions in cellular automata
inferredcites →https://doi.org/10.1016/s0304-3975(96)00084-9openalex-snapshot
On optimal solutions to the firing squad synchronization problem
inferredcites →https://doi.org/10.1016/s0304-3975(97)00073-xopenalex-snapshot
Parallel transient time of one-dimensional sand pile
inferredcites →https://doi.org/10.1016/s0304-3975(98)00096-6openalex-snapshot
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
inferredcites →https://doi.org/10.1016/s0304-3975(98)00150-9openalex-snapshot
Signals in one-dimensional cellular automata
inferredcites →https://doi.org/10.1016/s0304-3975(99)00075-4openalex-snapshot
Reversible space–time simulation of cellular automata
inferredcites →https://doi.org/10.1023/a:1014019225365openalex-snapshot
Non-Turing Computations Via Malament–Hogarth Space-Times
inferredcites →https://doi.org/10.1023/a:1021180801870openalex-snapshot
Infinite Time Turing Machines
inferredcites →https://doi.org/10.1086/289716openalex-snapshot
Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes
inferredcites →https://doi.org/10.1090/s0002-9947-1974-0347575-8openalex-snapshot
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
inferredcites →https://doi.org/10.1103/physreva.44.866openalex-snapshot
Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1108/k.2003.06732dae.007openalex-snapshot
Cellular Automata – A Discrete Universe
inferredcites →https://doi.org/10.1142/4702openalex-snapshot
Cellular Automata
inferredcites →https://doi.org/10.1145/321281.321290openalex-snapshot
Generation of Primes by a One-Dimensional Real-Time Iterative Array
inferredcites →https://doi.org/10.1145/380752.380878openalex-snapshot
Computing with continuous-time Liapunov systems
inferredcites →https://doi.org/10.2307/2586556openalex-snapshot
Infinite time Turing machines
inferredcites →https://doi.org/10.48550/arxiv.math/0212047openalex-snapshot
Infinite Time Turing Machines: Supertask Computation
inferredcites →https://doi.org/10.5860/choice.35-6275copenalex-snapshot
Complexity and real computation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11780342_18openalex-snapshot
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_26openalex-snapshot
Fractal Parallelism: Solving SAT in Bounded Space and Time
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_12openalex-snapshot
Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
inferred← citeshttps://doi.org/10.1007/s11047-012-9335-8openalex-snapshot
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.011openalex-snapshot
Pictures worth a thousand tiles, a geometrical programming language for self-assembly
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.013openalex-snapshot
Abstract geometrical computation 4: Small Turing universal signal machines
inferred← citeshttps://doi.org/10.1109/sasow.2010.23openalex-snapshot
Massively Parallel Automata in Euclidean Space-Time
inferred← citeshttps://doi.org/10.4204/eptcs.1.7openalex-snapshot
Small Turing universal signal machines
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09455openalex-snapshot
An algorithm to simulate alternating Turing machine in signal machine
inferred← citeshttps://doi.org/10.5445/ir/1000070923openalex-snapshot
Cellular Automata on Group Sets
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.