Hilbert’s Program Then and Now (2005)

by Richard Zach
Citations:4 - 0 self

Documents Related by Co-Citation

4 Thoughts on the Riemann Hypothesis – G. J. Chaitin - 2003
5 Backtrack: An O(1) Expected Time Graph Coloring Algorithm – H S Wilf - 1984
4 Reflecting on the 3x + 1 Mystery: Outline of a scenario”, U. Strasbourg preprint – E Belaga - 1998
4 NP-complete Problems and – S Aaronson - 2005
5 Algorithmic Information Theory, revised third printing – G J Chaitin - 1990
4 Chen,“On the Representation of a Large Even Integer as the Sum of a Prime and the Product of at Most Two Primes”, Kexue Tongbao 17 – J R - 1966
2 Rational Numbers Distribution and Resonance – K Dombrowski - 2005
2 The Collatz 3n + 1 Conjecture is Unprovable”, 2005. arXiv: math/0312309 – C A Feinstein
7 The Riemann Hypothesis and Pseudorandom – I J Good, R F Churchhouse - 1968
4 The Riemann-Siegel Formula and Large Scale Computations of the Riemann Zeta Function – Glendon Ralph Pugh - 1998
4 Name Distributions in the Social Security Area – M W Shackleford - 1997
5 Fermat’s Last Theorem.” From MathWorld–A Wolfram Web Resource – Eric W Weisstein - 2005
6 Undecidability and Intractability in Theoretical – S Wolfram - 1985
15 Prime Obsession – John Derbyshire - 2003
6 SUPERCOMPUTERS AND THE RIEMANN ZETA FUNCTION – A. M. Odlyzko
20 The tale of one-way functions – Leonid A. Levin - 2003
15 the Rise and Fall of Knapsack Cryptosystems, Cryptology and – A M Odlyzko - 1990
9 Exact Algorithms for NP-Hard Problems – Gerhard J. Woeginger - 2003
16 On the ‘‘3x+1’’ Problem – R E Crandall - 1978