On Finite-time Computability Preserving Conversions
A finite-time computable function is a partial function from Sigma(omega) to Sigma(omega) whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computability preserving conversion alpha : X -> Y for X, Y subset of Sigma(omega) is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain S. are extended sliding block functions.
finite-time computable functions sliding block functions constant-time computable functions computable analysis domain theory