Some mathematical limitations of the general-purpose analog computer

DOI10.1016/0196-8858(88)90004-8zbMath0678.68115OpenAlexW2033417496WikidataQ56812647 ScholiaQ56812647MaRDI QIDQ1124392

Lee A. Rubel

Publication date: 1988

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(88)90004-8

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Related Items (8)

An Unsolvable Cousin Problem ⋮ Recursion theory on the reals and continuous-time computation ⋮ The promise of analog computation ⋮ Simulation of Turing machine with uEAC-computable functions ⋮ Iteration, inequalities, and differentiability in analog computers ⋮ Real recursive functions and their hierarchy ⋮ Analog computation beyond the Turing limit ⋮ A new conceptual framework for analog computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• D-finite power series
• The complexity of analog computation
• Differentiably finite power series
• A triple universal entire function
• Linear hyperbolic partial differential equation with constant coefficients
• A universal Blaschke product
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• A Differentially Algebraic Elimination Theorem with Application to Analog Computability in the Calculus of Variations
• COHERENT FAMILIES OF POLYNOMIALS
• 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

This page was built for publication: Some mathematical limitations of the general-purpose analog computer