On Finite-time Computability Preserving Conversions

A finite-time computable function is a partial function from Σω to Σω whose value is constructed by applying finite number of list operations ‘cons’ and ‘head’ to 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.