Abstract geometrical computation 5: embedding computable analysis

Abstract : Extended Signal machines are proven capable to compute any computable function in the understanding of recursive/computable analysis (CA), represented here with type-2 Turing machines (T2-TM) and signed binary. This relies on a mixed representation of any real number as an integer (in signed binary) plus an exact value in $(-1,1)$. This permits to have only finitely many signals present simultaneously. Extracting a (signed) bit, improving the precision by one bit and iterating a 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 an infinite acceleration construction. Extracting/encoding an infinite sequence of bits is achieved as the limit of the approximation process with a careful handling of accumulations.
Document type :
Journal articles
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

Contributor : Jérôme Durand-Lose <>
Submitted on : Monday, February 8, 2010 - 10:59:57 PM
Last modification on : Thursday, February 7, 2019 - 5:04:33 PM
Long-term archiving on : Thursday, October 18, 2012 - 2:50:23 PM


Files produced by the author(s)




Jérôme Durand-Lose. Abstract geometrical computation 5: embedding computable analysis. Natural Computing, Springer Verlag, 2011, 10 (4), pp.1261-1273. ⟨10.1007/s11047-010-9229-6⟩. ⟨hal-00454605⟩



Record views


Files downloads