On the public citation graph

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems

0 signed · 23 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.1007/3-540-58201-0_58openalex-snapshot
On some relations between dynamical systems and transition systems
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.1016/0304-3975(93)00063-bopenalex-snapshot
Computing over the reals with addition and order
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(94)00228-bopenalex-snapshot
Reachability analysis of dynamical systems having piecewise-constant derivatives
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/0885-064x(92)90007-xopenalex-snapshot
A note on a P ≠ NP result for a restricted class of real machines
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.1090/s0273-0979-1989-15750-9openalex-snapshot
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
inferredcites →https://doi.org/10.1109/sfcs.1993.366838openalex-snapshot
A weak version of the Blum, Shub and Smale model
inferredcites →https://doi.org/10.2307/2348852openalex-snapshot
Real and Complex Analysis.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11494645_14openalex-snapshot
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
inferred← citeshttps://doi.org/10.1007/11867340_17openalex-snapshot
On the Computational Power of Timed Differentiable Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-33924-5_6openalex-snapshot
Computing in Perfect Euclidean Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-319-58187-3_2openalex-snapshot
Ways to Compute in Euclidean Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_25openalex-snapshot
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
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/s11047-009-9117-0openalex-snapshot
Abstract geometrical computation 3: black holes for classical and analog computing
inferred← citeshttps://doi.org/10.1016/j.jco.2016.05.002openalex-snapshot
Computing with polynomial ordinary differential equations
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.06.001openalex-snapshot
Abstract geometrical computation 8: Small machines, accumulations & rationality
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00096-6openalex-snapshot
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
inferred← citeshttps://doi.org/10.1109/sasow.2010.23openalex-snapshot
Massively Parallel Automata in Euclidean Space-Time
inferred← citeshttps://doi.org/10.48550/arxiv.1307.6468openalex-snapshot
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality
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.