Computing on the Banach space C [ 0 , 1 ]
We demonstrate that, within any computable presentation of the Banach space C [ 0 , 1 ], computing 1 is no harder than computing the halting set. Additionally, we prove that the modulus operator | · | is Ø ″ -computable and use this to show that C [ 0 , 1 ] is Δ 3 0 -categorical when we restrict ourselves to the presentations in which at least one homeomorphism of the unit interval onto itself is computable.
2007 ◽
Vol 2007
◽
pp. 1-7
◽
1991 ◽
Vol 50
(3)
◽
pp. 391-408
◽
1993 ◽
Vol 47
(2)
◽
pp. 297-306
◽
Keyword(s):
2003 ◽
Vol 34
(1)
◽
pp. 71-76
◽
1990 ◽
Vol 10
(3)
◽
pp. 327-343
◽
2012 ◽
Vol 112
(1)
◽
pp. 21-35
◽
Keyword(s):
2015 ◽
Vol 3
(2)
◽
pp. 173-182
Keyword(s):