Some mathematical limitations of the general-purpose analog computer
Advances in Applied Mathematics
A survey of transcendentally transcendental functions
American Mathematical Monthly
Regular Article: The Extended Analog Computer
Advances in Applied Mathematics
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Iteration, inequalities, and differentiability in analog computers
Journal of Complexity
Svein Rosseland and the Oslo Analyzer
IEEE Annals of the History of Computing
Analog computers and recursive functions over the reals
Journal of Complexity
Hi-index | 0.00 |
In this paper we compare the computational power of the Extended Analog Computer (EAC) with partial recursive functions. We first give a survey of some part of computational theory in discrete and in real space. In the last section we show that the EAC can generate any partial recursive function defined over N. Moreover we conclude that the classical halting problem for partial recursive functions is an equivalent of testing by EAC if sets are empty or not.