The extended analog computer
From MaRDI portal
Publication:1802342
DOI10.1006/AAMA.1993.1003zbMATH Open0805.68010OpenAlexW2052032610WikidataQ56812635 ScholiaQ56812635MaRDI QIDQ1802342FDOQ1802342
Authors: Lee A. Rubel
Publication date: 26 January 1995
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1993.1003
Recommendations
Cited In (20)
- Analog computation with dynamical systems
- Model-based computation
- Real recursive functions and their hierarchy
- A Survey on Analog Models of Computation
- Iteration, inequalities, and differentiability in analog computers
- Undecidability through Fourier series
- Title not available (Why is that?)
- The promise of analog computation
- \(\mu\)-recursion and infinite limits.
- HAPS, a Handy Analog Programming System
- A new conceptual framework for analog computation
- Natural computation and non-Turing models of computation
- Simulation of Turing machine with uEAC-computable functions
- Analog computers in stochastic phenomena
- Recursion theory on the reals and continuous-time computation
- Title not available (Why is that?)
- The power of analogue-digital machines (extended abstract)
- Methods for solving engineering problems using analog computers. Chapters 9 and 10 contributed by Arnold Levine
- Analog computation beyond the Turing limit
- The nature of the extended analog computer
This page was built for publication: The extended analog computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802342)