Computability of analog networks
type: Item
instance of: scholarly article
title: Computability of analog networks
zbMATH Open document ID: 1110.68046
author: John V. Tucker
author: Jeffery Zucker
published in: Theoretical Computer Science
publication date: 2007-03-12T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5132990
zbMATH Keywords: analog computation
zbMATH Keywords: analog computing
zbMATH Keywords: analog networks
zbMATH Keywords: continuous time
zbMATH Keywords: continuous streams
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.10.018
OpenAlex ID: W2050243630
cites work: Theory and Applications of Models of Computation
cites work: Polynomial differential equations compute all real computable functions on computable compact intervals
cites work: Q3679172
cites work: Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
cites work: The differential analyzer. A new machine for solving differential equations
cites work: Q3999241
cites work: An analog characterization of the Grzegorczyk hierarchy
cites work: Q3994935
cites work: Analog computers and recursive functions over the reals.
cites work: New Computational Paradigms
cites work: Handbook of computability theory
cites work: Q5816908
cites work: Q5339529
cites work: Q5796249
cites work: Q5812175
cites work: A Differentially Algebraic Replacement Theorem, and Analog Computability
cites work: Real recursive functions and their hierarchy
cites work: Recursion theory on the reals and continuous-time computation
cites work: Computability in quantum mechanics.
cites work: Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
cites work: Q3994907
cites work: On the role of mathematics and mathematical knowledge in the invention of Vannevar Bush's early analog computers
cites work: Automata over continuous time
cites work: Q5731904
cites work: From finite automata toward hybrid systems (Extended abstract)
cites work: Q5526189
cites work: Mathematical Theory of the Differential Analyzer
cites work: Concrete models of computation for topological algebras
cites work: Q3998903
cites work: Finite automata and the logic of one-place predicates
cites work: Q4842541
cites work: Abstract versus concrete computation on metric partial algebras
cites work: Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
cites work: Q5477367
cites work: Q4485693
cites work: The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
DOI: 10.1016/J.TCS.2006.10.018
Recommended article: The complexity of analog computation
Recommended article: Stochastic analog networks and computational complexity
Recommended article: New Computational Paradigms
Recommended article: Scaling and universality of the complexity of analog computation
Recommended article: A Survey on Analog Models of Computation
Recommended article: A Step towards a Complexity Theory for Analog Systems
Recommended article: On the complexity of encoding in analog circuits
Recommended article: A new conceptual framework for analog computation
Recommended article: Analog computation beyond the Turing limit
Recommended article: A universal scaling theory for complexity of analog computation
description: scientific article; zbMATH DE number 5132990