Asymptotic Density and the Theory of Computability: A Partial Survey

The purpose of this paper is to survey recent work on how classical asymptotic density interacts with the theory of computability. We have tried to make the survey accessible to those who are not specialists in computability theory and we mainly state results without proof, but we include a few easy proofs to illustrate the flavor of the subject.

[1]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[2]  Eric P. Astor,et al.  Asymptotic density, immunity and randomness , 2014, Comput..

[3]  Gregory Igusa.  Nonexistence of minimal pairs for generic computability , 2013, J. Symb. Log..

[4]  André Nies,et al.  A Unifying Approach to the Gamma Question , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[5]  Paul E. Schupp,et al.  COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS , 2015, The Journal of Symbolic Logic.

[6]  Laurent Bienvenu,et al.  From bi-immunity to absolute undecidability , 2013, J. Symb. Log..

[7]  A. Myasnikov,et al.  Non-Commutative Cryptography and Complexity of Group-Theoretic Problems , 2011 .

[8]  Yuri Gurevich,et al.  Average Case Completeness , 1991, J. Comput. Syst. Sci..

[9]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[10]  Gregory Igusa.  The Generic Degrees of density-1 Sets, and a characterization of the Hyperarithmetic Reals , 2015, J. Symb. Log..

[11]  A. Myasnikov,et al.  ALGORITHMICALLY FINITE GROUPS , 2010, 1012.1653.

[12]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[13]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Paul E. Schupp,et al.  Asymptotic density and the coarse computability bound , 2015, Comput..

[16]  Vladimir Shpilrain,et al.  Generic case complexity , 2011 .

[17]  Carl G. Jockusch,et al.  The degrees of bi-immune sets , 1969 .

[18]  J. Rotman.  An Introduction to the Theory of Groups , 1965 .

[19]  Ilya Kapovich,et al.  Generic-case complexity, decision problems in group theory and random walks , 2002, ArXiv.

[20]  A. Nies.  Computability and randomness , 2009 .

[21]  Paul E. Schupp,et al.  Asymptotic density and computably Enumerable Sets , 2013, J. Math. Log..

[22]  Paul E. Schupp,et al.  Asymptotic density and the Ershov hierarchy , 2013, Math. Log. Q..

[23]  André Nies,et al.  Indifferent Sets , 2009, J. Log. Comput..

[24]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[25]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[26]  Sebastiaan Terwijn,et al.  Computational randomness and lowness* , 2001, Journal of Symbolic Logic.

[27]  Damir D. Dzhafarov,et al.  Notions of robust information coding , 2014, Comput..

[28]  Matthew Harrison-Trainor.  The Gamma question for many-one degrees , 2017, Ann. Pure Appl. Log..

[29]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[30]  Denis R. Hirschfeldt,et al.  Dense computability, upper cones, and minimal pairs , 2018, Comput..

[31]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[32]  Alexei G. Myasnikov,et al.  Generic complexity of undecidable problems , 2008, Journal of Symbolic Logic.

[33]  Wolfgang Woess,et al.  Cogrowth of groups and simple random walks , 1983 .

[34]  Paul E. Schupp,et al.  Generic computability, Turing degrees, and asymptotic density , 2010, J. Lond. Math. Soc..

[35]  Denis R. Hirschfeldt,et al.  Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[36]  Eric P. Astor.  Asymptotic density and effective negligibility , 2015 .

[37]  Carl G. Jockusch,et al.  Asymptotic density, computable traceability, and 1-randomness , 2016 .

[38]  Stuart A. Kurtz,et al.  Notions of Weak Genericity , 1983, J. Symb. Log..