Computability of analog networks

DOI10.1016/J.TCS.2006.10.018zbMATH Open1110.68046OpenAlexW2050243630MaRDI QIDQ870263FDOQ870263

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

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

zbMATH Keywords

continuous timeanalog computationanalog computinganalog networkscontinuous streams

Mathematics Subject Classification ID

Cites Work

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

Cited In (15)

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

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)