New Computational Paradigms
From MaRDI portal
Publication:5717036
DOI10.1007/b136981zbMath1115.68083OpenAlexW2278484831MaRDI QIDQ5717036
Campagnolo, Manuel Lameiras, Jorge Buescu, Daniel Silva Graça
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136981
Related Items
Polynomial differential equations compute all real computable functions on computable compact intervals, Computation with perturbed dynamical systems, A note on discreteness and virtuality in analog computing, Computability of analog networks, An RNA-based theory of natural universal computation, Reachability in Linear Dynamical Systems, Computing Omega-Limit Sets in Linear Dynamical Systems, Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs, Computability with polynomial differential equations, A survey of recursive analysis and Moore's notion of real computation, How much can analog and hybrid systems be proved (super-)Turing, Finite time blowup for an averaged three-dimensional Navier-Stokes equation, A foundation for real recursive function theory, Computability and Beltrami fields in Euclidean space, A Survey on Analog Models of Computation