Title of article
On Finite-time Computability Preserving Conversions
Author/Authors
Tsuiki, Hideki Kyoto University - Graduate School of Human and Environmental Studies, Japan , Yamada, Shuji Kyoto Sangyo University - Faculty of Science, Japan
From page
1365
To page
1380
Abstract
Abstract: 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 (rightarrow)Y for X, Y (rightarrow) Σω 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.
Keywords
Finite , time Computable Functions , Constant , time Computable Functions , Sliding Block Functions , Computable Analysis , Domain Theory
Journal title
International Journal of Universal Computer Sciences
Journal title
International Journal of Universal Computer Sciences
Record number
2574706
Link To Document