Archive for Mathematical Logic 45 (3):365-379 (2006)
Abstract |
We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces constructed
|
Keywords | TTE Computability Measure Measurable set computable topological space |
Categories | (categorize this paper) |
Reprint years | 2005, 2006 |
ISBN(s) | |
DOI | 10.1007/s00153-005-0315-x |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
On the Computability of Fractal Dimensions and Hausdorff Measure.Ker-I. Ko - 1998 - Annals of Pure and Applied Logic 93 (1-3):195-216.
Citations of this work BETA
No citations found.
Similar books and articles
Computability of Measurable Sets Via Effective Metrics.Yongcheng Wu & Decheng Ding - 2005 - Mathematical Logic Quarterly 51 (6):543-559.
Computability and Continuity in Computable Metric Partial Algebras Equipped with Computability Structures.F. Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras.Viggo Stoltenberg-Hansen & John V. Tucker - 2003 - Bulletin of Symbolic Logic 9 (3):299-334.
Computing the Topological Entropy of Shifts.Christoph Spandl - 2007 - Mathematical Logic Quarterly 53 (4):493-510.
Uniform Domain Representations of "Lp" -Spaces.Petter K. Køber - 2007 - Mathematical Logic Quarterly 53 (2):180-205.
Completeness of S4 for the Lebesgue Measure Algebra.Tamar Lando - 2012 - Journal of Philosophical Logic 41 (2):287-316.
Computability of Compact Operators on Computable Banach Spaces with Bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
Domatic Partitions of Computable Graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Algorithmic Randomness of Continuous Functions.George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):533-546.
Borel Complexity and Computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.
Analytics
Added to PP index
2013-11-23
Total views
23 ( #495,364 of 2,519,667 )
Recent downloads (6 months)
1 ( #406,756 of 2,519,667 )
2013-11-23
Total views
23 ( #495,364 of 2,519,667 )
Recent downloads (6 months)
1 ( #406,756 of 2,519,667 )
How can I increase my downloads?
Downloads