Some recent developments on Shannon's General Purpose Analog Computer
From MaRDI portal
Publication:3159432
DOI10.1002/malq.200310113zbMath1089.68039OpenAlexW177079861MaRDI QIDQ3159432
Publication date: 16 February 2005
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.1/1004
analog computationdynamical systemsGamma functionAnalog circuitsShannon's general purpose analog computer
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Circuits, networks (94C99)
Related Items
Characterizing time computational complexity classes with polynomial differential equations, Polynomial differential equations compute all real computable functions on computable compact intervals, Computing with polynomial ordinary differential equations, Real-time computability of real numbers by chemical reaction networks, A note on discreteness and virtuality in analog computing, Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems, On the functions generated by the general purpose analog computer, A continuous characterization of PSPACE using polynomial ordinary differential equations, The elementary computable functions over the real numbers: applying two new techniques, The nature of the extended analog computer, Characterizing Computable Analysis with 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, Computational bounds on polynomial differential equations, Anti-heterotic Computing, A Survey on Analog Models of Computation
