Skip to search formSkip to main contentSkip to account menu

Π01 class

Known as: Pi01 class 
In computability theory, a Π01 class is a subset of 2ω of a certain form. These classes are of interest as a technical tool within recursion theory… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
We present an overview of the topics in the title and of some of the key results pertaining to them. These have historically been… 
2010
2010
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor… 
2008
2008
  • S. Binns
  • Journal of Symbolic Logic
  • 2008
  • Corpus ID: 1149675
Abstract An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a… 
2008
2008
  • C. Alfeld
  • Notre Dame J. Formal Log.
  • 2008
  • Corpus ID: 41637643
A Π 1 0 class can be defined as the set of infinite paths through a computable tree. For classes P and Q , say that P is Medvedev… 
2007
2007
  • C. Alfeld
  • Journal of Symbolic Logic
  • 2007
  • Corpus ID: 11171790
Abstract A class is the set of paths through a computable tree. Given classes P and Q, P is Medvedev reducible to Q, P ≤MQ, if… 
2006
2006
  • L. Lawton
  • Arch. Math. Log.
  • 2006
  • Corpus ID: 206886745
We explore an analogue of major subset for Π01 classes, which leads to the definition and characterization of almost complemented… 
2006
2006
We explore an analogue of major subset for 1 classes, which leads to the definition and characterization of almost complemented 1… 
2004
2004
Abstract.Let w and M be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π10 subsets of 2ω, under… 
1994
1994