|
|
|
|
On Finite-time Computability Preserving Conversions
|
|
|
|
|
|
|
|
نویسنده
|
Tsuiki Hideki ,Yamada Shuji
|
|
منبع
|
journal of universal computer science - 2009 - دوره : 15 - شماره : 6 - صفحه:1365 -1380
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Finite-time Computable Functions ,Constant-time Computable Functions ,Sliding Block Functions ,Computable Analysis ,Domain Theory
|
|
آدرس
|
Kyoto University, Graduate School of Human and Environmental Studies, Japan, Kyoto Sangyo University, Faculty of Science, Japan
|
|
پست الکترونیکی
|
yamada@cc.kyoto-su.ac.jp
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|