Evaluating the Complexity of Mathematical Problems. Part 1 (2009)

Cached

Download Links

by C. S. Calude , Elena Calude
Citations:1 - 0 self

Active Bibliography

Mathematical Problems. Part 1 ∗ – C. S. Calude, Elena Calude, Cristian S. Calude, Elena Calude - 2008
2 The Complexity of the Four Colour Theorem – Cristian S. Calude, Elena Calude - 2009
10 A New Measure of the Difficulty of Problems – Cristian S. Calude, Elena Calude, Michael J. Dinneen - 2006
Most short programs halt quickly – Cristian S. Calude, Michael A. Stay - 2008
9 Most programs stop quickly or never halt – Cristian S. Calude, Michael A. Stay
2 THE MAXIMAL NUMBER OF EXCEPTIONAL DEHN SURGERIES – Marc Lackenby, Robert Meyerhoff - 808
4 Boolean relation theory and . . . – Harvey M. Friedman - 2011
unknown title – unknown authors
Hundred beautiful mathematical theorems with short proofs – Jörg Neunhäuserer
Formal Proof: Reconciling Correctness and Understanding – Cristian S. Calude, Christine Müller
4 Every Computably Enumerable Random Real Is Provably Computably Enumerable Random – Cristian S. Calude, Nicholas J. Hay - 2009
Simplicity via Provability for Universal Prefix-free Turing Machines – Cristian S. Calude - 2008
1 S.: Passages of proof – Cristian S. Calude, Elena Calude, Solomon Marcus - 2004
legitimise the conquests of intuition... J. – Cristian S. Calude, Elena Calude, Solomon Marcus - 2008
8 Exact Approximations of Omega Numbers – C. S. Calude, M. J. Dinneen, Cristian S. Calude, Michael J. Dinneen
A Program-Size Complexity Measure for Mathematical Problems and Conjectures – Michael J. Dinneen
9 Bio-Steps Beyond Turing – Cristian S. Calude, Gheorghe Păun - 2004
1 Bounds on exceptional Dehn filling II – Ian Agol
Graph Theoretical Problems and Related Polytopes: Stable Sets and Perfect Graphs – Annegret Wagler