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. Key Words: Finite-time Computable Functions, Constant-time Computable Functions, Sliding Block Functions, Computable Analysis, Domain Theory.

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Hideki Tsuiki, Shuji Yamada
• Keywords: Computable Functions, ENTCS 2008, ENTCS 2010, Finite-time Computability, Finite-time Computable Functions