2 research outputs found
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