Computability of analog networks

DOI10.1016/j.tcs.2006.10.018zbMath1110.68046OpenAlexW2050243630MaRDI QIDQ870263

J. V. Tucker, Jeffery Zucker

Publication date: 12 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.018

zbMATH Keywords

analog computationcontinuous timeanalog computinganalog networkscontinuous streams

Mathematics Subject Classification ID

Related Items (10)

A model of systems with modes and mode transitions ⋮ Fixed Point Techniques in Analog Systems ⋮ The nature of the extended analog computer ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ Physical constraints on hypercomputation ⋮ Continuity of operators on continuous and discrete time streams ⋮ 2007 Spring Meeting of the Association for Symbolic Logic ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real recursive functions and their hierarchy
• Concrete models of computation for topological algebras
• Handbook of computability theory
• Recursion theory on the reals and continuous-time computation
• Automata over continuous time
• Analog computers and recursive functions over the reals.
• The differential analyzer. A new machine for solving differential equations
• Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• An analog characterization of the Grzegorczyk hierarchy
• Polynomial differential equations compute all real computable functions on computable compact intervals
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• On the role of mathematics and mathematical knowledge in the invention of Vannevar Bush's early analog computers
• From finite automata toward hybrid systems (Extended abstract)
• Abstract versus concrete computation on metric partial algebras
• Finite automata and the logic of one-place predicates
• New Computational Paradigms
• Mathematical Theory of the Differential Analyzer
• Theory and Applications of Models of Computation

This page was built for publication: Computability of analog networks