On Finite-time Computability Preserving Conversions

A finite-time computable function is a partial function from Σ to Σ whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computability preserving conversion α : X → Y for X, Y ⊂ Σ is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain Σ are extended sliding block functions.

[1]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[2]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Hideki Tsuiki,et al.  On Finite-time Computability Preserving Conversions , 2008, Electron. Notes Theor. Comput. Sci..

[4]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[5]  Hideki Tsuiki,et al.  Real number computation through Gray code embedding , 2002, Theor. Comput. Sci..

[6]  P. Daniel Hestand,et al.  Mathematical theory of domains , 2002, SIGA.