Open Access
2011 Mass problems associated with effectively closed sets
Stephen G. Simpson
Tohoku Math. J. (2) 63(4): 489-517 (2011). DOI: 10.2748/tmj/1325886278

Abstract

The study of mass problems and Muchnik degrees was originally motivated by Kolmogorov's non-rigorous 1932 interpretation of intuitionism as a calculus of problems. The purpose of this paper is to summarize recent investigations into the lattice of Muchnik degrees of nonempty effectively closed sets in Euclidean space. Let $\mathcal{E}_\mathrm{w}$ be this lattice. We show that $\mathcal{E}_\mathrm{w}$ provides an elegant and useful framework for the classification of certain foundationally interesting problems which are algorithmically unsolvable. We exhibit some specific degrees in $\mathcal{E}_\mathrm{w}$ which are associated with such problems. In addition, we present some structural results concerning the lattice $\mathcal{E}_\mathrm{w}$. One of these results answers a question which arises naturally from the Kolmogorov interpretation. Finally, we show how $\mathcal{E}_\mathrm{w}$ can be applied in symbolic dynamics, toward the classification of tiling problems and $\boldsymbol{Z}^d$-subshifts of finite type.

Citation

Download Citation

Stephen G. Simpson. "Mass problems associated with effectively closed sets." Tohoku Math. J. (2) 63 (4) 489 - 517, 2011. https://doi.org/10.2748/tmj/1325886278

Information

Published: 2011
First available in Project Euclid: 6 January 2012

zbMATH: 1246.03064
MathSciNet: MR2872953
Digital Object Identifier: 10.2748/tmj/1325886278

Subjects:
Primary: 03D30
Secondary: 03D20 , 03D25 , 03D28 , 03D32 , 03D55 , 03D80 , 37B10

Keywords: algorithmic randomness , degrees of unsolvability , hyperarithmetical hierarchy , intuitionism , Kolmogorov complexity , mass problems , Muchnik degrees , proof theory , recursively enumerable degrees , resourse-bounded computational complexity , unsolvable problems

Rights: Copyright © 2011 Tohoku University

Vol.63 • No. 4 • 2011
Back to Top