Index sets and universal numberings
暂无分享,去创建一个
[1] Donald A. Martin. Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .
[2] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.
[3] Wolfgang Merkle,et al. Kolmogorov Complexity and the Recursion Theorem , 2006, STACS.
[4] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[5] George Barmpalias,et al. Immunity Properties and the n-C.E. Hierarchy , 2006, TAMC.
[6] R. Soare. Recursively enumerable sets and degrees , 1987 .
[7] P. Odifreddi. The theory of functions and sets of natural numbers , 1989 .
[8] Jason Teutsch. Noncomputable Spectral Sets , 2007, ArXiv.
[9] P. Odifreddi. Classical recursion theory , 1989 .
[10] John Case,et al. Control Structures in Hypothesis Spaces: The Influence on Learning , 1997, EuroCOLT.
[11] Valentina S. Harizanov,et al. Frequency Computations and the Cardinality Theorem , 1992, J. Symb. Log..
[12] Marcus Schaefer. A guided tour of minimal indices and shortest descriptions , 1998, Arch. Math. Log..
[13] H. Rice. Classes of recursively enumerable sets and their decision problems , 1953 .
[14] Martin Kummer,et al. Cuppability of Simple and Hypersimple Sets , 2007, Notre Dame J. Formal Log..
[15] Lance Fortnow,et al. Enumerations of the Kolmogorov function , 2006, Journal of Symbolic Logic.
[16] Stuart A. Kurtz,et al. Extremes in the Degrees of Inferability , 1994, Ann. Pure Appl. Log..
[17] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.
[18] Jason Teutsch. On the Turing degrees of minimal index sets , 2007, Ann. Pure Appl. Log..
[19] C. Jockusch. Degrees of generic sets , 1980 .
[20] James C. Owings,et al. A cardinality version of Beigel's nonspeedup theorem , 1989, Journal of Symbolic Logic.
[21] George Barmpalias,et al. Post's Programme for the Ershov Hierarchy , 2007, J. Log. Comput..
[22] Albert R. Meyer. Program Size in Restricted Programming Languages , 1972, Inf. Control..
[23] Martin Kummer. A Proof of Beigel's Cardinality Conjecture , 1992, J. Symb. Log..