Formalizing the presumption of independence

Harald Cramér, On the order of magnitude of the difference between consecutive prime numbers , Acta arithmetica 2

1936

Earlier work this paper cites.

Martin Hugo Löb, Solution of a problem of leon henkin , The Journal of Symbolic Logic 20

1955

Earlier work this paper cites.

P Erdös and S Ulam, Some probabilistic remarks on fermat’s last theorem , The Rocky Mountain Journal of Mathematics 1

1971

Earlier work this paper cites.

Noam D Elkies, On a ˆ 4+b ˆ 4+c ˆ 4=d ˆ 4 , Mathematics of Computation (1988), 825–835

1988

Earlier work this paper cites.

Roger E Frye, Finding 95800 4+ 217519 4+ 414560 4= 422481 4 on the connection machine , Proceedings of supercomputing, vol. 88, 1988, pp. 106–116

1988

Earlier work this paper cites.

Shafi Goldwasser, Silvio Micali, and Charles Rackoff, The knowledge complexity of interactive proof systems , SIAM J. COMPUT 18

1989

Earlier work this paper cites.

Jerzy Kaczorowski, On the distribution of primes (mod4) , Analysis 15

1995

Earlier work this paper cites.

Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang, On the (im) possibility of obfuscating programs , Annual international cryptology conference, Springer, 2001, pp. 1–18

2001

Earlier work this paper cites.

Marc Mézard and Riccardo Zecchina, Random k-satisfiability problem: From an analytic solution to an efficient algorithm , Physical Review E 66

2002

Cited alongside, same era.

Haim Gaifman, Reasoning with limited resources and assigning probabilities to arithmetical statements , Synthese 140

2004

Cited alongside, same era.

Freeman Dyson, What We Believe but Cannot Prove (John Brockman, ed.), Harper Perennial, 2006, pp. 82–83

2006

Cited alongside, same era.

Andrew Granville and Greg Martin, Prime number races , The American Mathematical Monthly 113

2006

Cited alongside, same era.

János Pintz, Cramér vs. Cramér. On Cramér’s probabilistic model for primes , Functiones et Approximatio Commentarii Mathematici 37

2007

Cited alongside, same era.

John H Conway, On unsettleable arithmetical problems , The American Mathematical Monthly 120

2013

Later among the works it cites.

Paul Christiano, Non-omniscience, probabilistic inference, and metamathematics , 2014

2014

Later among the works it cites.

Brent Waters, A punctured programming approach to adaptively secure functional encryption , Annual Cryptology Conference, Springer, 2015, pp. 678–697

2015

Later among the works it cites.

Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch, Nate Soares, and Jessica Taylor, Logical induction , arXiv preprint arXiv:1609.03543 (2016)

Original

2016

Later among the works it cites.

Nima Anari, Leonid Gurvits, Shayan Oveis Gharan, and Amin Saberi, Simply exponential approximation of the permanent of positive semidefinite matrices , 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2017, pp. 914–925