On Finite-time Computability Preserving Conversions

Authors:
Hideki Tsuiki;Shuji Yamada
Affiliations:
Graduate School of Human and Environmental Studies, Kyoto University, 606-8501 Kyoto, Japan;Faculty of Science, Kyoto Sangyo University, 603-8555 Kyoto, Japan
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 4
Cited 0

Mathematical theory of domains

Mathematical theory of domains
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Computable analysis: an introduction

Computable analysis: an introduction
Real number computation through gray code embedding

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.