Mathematical Theory of the Differential Analyzer
From MaRDI portal
Cited in
(64)- A new conceptual framework for analog computation
- Computational bounds on polynomial differential equations
- The complexity of analog computation
- Some mathematical limitations of the general-purpose analog computer
- Solutions of algebraic differential equations
- Equisolution matrices for the matric computor
- Recursion theory on the reals and continuous-time computation
- Analog computers and recursive functions over the reals.
- Natural computation and non-Turing models of computation
- Analog computation with dynamical systems
- A theory of complexity for continuous time systems
- Simulation of Turing machine with uEAC-computable functions
- On the functions generated by the general purpose analog computer
- Mathematical instruments between material artifacts and ideal machines: their scientific and social role before 1950. Abstracts from the workshop held December 17--23, 2017
- A survey of recursive analysis and Moore's notion of real computation
- An analog characterization of the Grzegorczyk hierarchy
- Programming with ordinary differential equations: some first steps towards a programming language
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Spectral representations and global maps of cellular automata dynamics
- Computability with polynomial differential equations
- The case for hypercomputation
- Analog computation beyond the Turing limit
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- When does a physical system compute?
- Computing with polynomial ordinary differential equations
- Axiomatizing analog algorithms
- Some Research Problems about Algebraic Differential Equations
- A Differentially Algebraic Elimination Theorem with Application to Analog Computability in the Calculus of Variations
- A universal differential equation
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Control: a perspective
- Economic Dynamics and Computation—Resurrecting the Icarus Tradition
- Characterizing Computable Analysis with Differential Equations
- Turing machines can be efficiently simulated by the general purpose analog computer
- Computability of Differential Equations
- A Survey on Analog Models of Computation
- A universal ordinary differential equation
- A numerical method for solving ordinary differential equations by converting them into the form of a Shannon
- Numerical solution of stiff systems of ordinary differential equations by converting them to the form of a Shannon
- A Geometrical Constructive Approach to Infinitesimal Analysis: Epistemological Potential and Boundaries of Tractional Motion
- Obituary: Claude Elwood Shannon 1916-2001
- Experimental computation of real numbers by Newtonian machines
- Computational complexity with experiments as oracles
- Characterizing time computational complexity classes with polynomial differential equations
- Iteration, inequalities, and differentiability in analog computers
- Computing with chemical reaction networks: a tutorial
- From electric circuits to chemical networks
- A continuous characterization of PSPACE using polynomial ordinary differential equations
- On estimating derivatives of input signals in biochemistry
- Theoretical computer science: computability, decidability and logic
- Constraint nets: a semantic model for hybrid dynamic systems
- Quantifiying the robustness of dynamical systems. Relating time and space to length and precision
- The complexity of computing in continuous time: space complexity is precision
- Computation with real numbers and continuous-time dynamical systems
- Solving discontinuous initial value problems with unique solutions is equivalent to computing over the transfinite
- Matrix multiplication in quadratic time and energy? Towards a fine-grained energy-centric church-Turing thesis
- Real recursive functions and their hierarchy
- A characterization of computable analysis on unbounded domains using differential equations
- Quantifying the robustness of dynamical systems. Relating time and space to length and precision
- A selective dual-railing technique for general-purpose analog computers
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- Computability of analog networks
- Computability on reals, infinite limits and differential equations
This page was built for publication: Mathematical Theory of the Differential Analyzer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5841117)
