On Finite-time Computability Preserving Conversions
Hideki Tsuiki, Shûji Yamada · TUGraz OPEN Library (Graz University of Technology) · 2020
A finite-time computable function is a partial function from @S^@w to @S^@w whose value is constructed by applying finite number of list operations 'cons' and 'head' to the argument. A finite-time computability preserving conversion @a:X->Y for X,Y@?@S^@w is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain @S^@w are extended sliding block functions.