Computability of analog networks

DOI10.1016/J.TCS.2006.10.018MaRDI QIDQ870263zbMATH OpenOpenAlexFDO

Authors John 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

continuous timeanalog computationanalog computinganalog networkscontinuous streams

Mathematics Subject Classification ID

Recommendations

• The complexity of analog computation
• Stochastic analog networks and computational complexity
• New Computational Paradigms
• Scaling and universality of the complexity of analog computation
• A Survey on Analog Models of Computation
• A Step towards a Complexity Theory for Analog Systems
• On the complexity of encoding in analog circuits
• A new conceptual framework for analog computation
• Analog computation beyond the Turing limit
• A universal scaling theory for complexity of analog computation

Cites work

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

Cited in

(15)

• A model of systems with modes and mode transitions
• 2007 Spring Meeting of the Association for Symbolic Logic
• New Computational Paradigms
• Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
• The complexity of analog computation
• Continuity of operators on continuous and discrete time streams
• Analog networks on function data streams
• Generalizing Computability Theory to Abstract Algebras
• Computability of operators on continuous and discrete time streams
• Computations via Newtonian and relativistic kinematic systems
• The nature of the extended analog computer
• Physical constraints on hypercomputation
• A Survey on Analog Models of Computation
• Fixed Point Techniques in Analog Systems
• On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers

This page was built for publication: Computability of analog networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870263)