![]() | ![]() |
| 2012 | ||
|---|---|---|
| 4 | Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret: Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Electronic Colloquium on Computational Complexity (ECCC) 19: 28 (2012) | |
| 2004 | ||
| 3 | George Davie: Characterising the Martin-Löf random sequences using computably enumerable sets of measure one. Inf. Process. Lett. 92(3): 157-160 (2004) | |
| 2002 | ||
| 2 | George Davie: Kolmogorov Complexity and Noncomputability. Math. Log. Q. 48(4): 574-580 (2002) | |
| 2001 | ||
| 1 | George Davie: Recursive events in random sequences. Arch. Math. Log. 40(8): 629-638 (2001) | |
| 1 | Eric Allender | [4] |
| 2 | Luke Friedman | [4] |
| 3 | Samuel Hopkins | [4] |
| 4 | Iddo Tzameret | [4] |
Data released under the ODC-BY 1.0 license — See also our legal information page