Abstract Geometrical Computation and Computable Analysis
Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary encoding. This relies on an intermediate representation of any real number as an integer (in signed binary) plus an exact value in ( − 1,1) which allows to have only finitely many signals present outside of the computation. Extracting a (signed) bit, improving the precision by one bit and iterating the T2-TM only involve standard signal machines.
For exact CA-computations, T2-TM have to deal with an infinite entry and to run through infinitely many iterations to produce an infinite output. This infinite duration can be provided by constructions emulating the black hole model of computation on an extended signal machine. Extracting/encoding an infinite sequence of bits is achieved as the limit of the approximation process with a careful handling of accumulations and singularities.
KeywordsAnalog computation Abstract geometrical computation Computable analysis Signal machine Type-2 Turing machine
Unable to display preview. Download preview PDF.
- Durand-Lose, J.: Abstract geometrical computation with accumulations: Beyond the Blum, Shub and Smale model. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) Logic and Theory of Algorithms, 4th Conf. Computability in Europe (CiE 2008) (abstracts and extended abstracts of unpublished papers), pp. 107–116. University of Athens (2008)Google Scholar
- Durand-Lose, J.: Abstract geometrical computation 3: Black holes for classical and analog computing. Nat. Comput (2009), doi:10.1007/s11047-009-9117-0Google Scholar
- Hogarth, M.L.: Non-Turing computers and non-Turing computability. In: Biennial Meeting of the Philosophy of Science Association, pp. 126–138 (1994)Google Scholar