Stephen G. Simpson

Computational Theory and Mathematics · 2007–2013

A researcher in the Science corpus: 3 papers; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 6 citations into it; #11,732 of 12,182 by trust here, #11,462 by citations

Whom Stephen G. Simpson trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Joseph S. Miller
2. André Nies

Who trusts Stephen G. Simpson overall

1. Ludovic Patey

Papers from Stephen G. Simpson's perspective

Ordered by how strongly the researchers Stephen G. Simpson trusts endorse each paper. Same corpus, a different order for every researcher.

1. Tilings
2. On Computable Numbers, with an Application to the Entscheidungsproblem.
3. Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
4. An extension of the recursively enumerable Turing degrees
5. A Theory of Program Size Formally Identical to Information Theory
6. Computability and randomness
7. Algorithmic Randomness and Complexity (Theory and Applications of Computability)
8. A Mathematical Theory of Communication
9. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
10. On initial segment complexity and degrees of randomness

Their papers

• An extension of the recursively enumerable Turing degrees (2007) — 60 citations
• Schnorr randomness and the Lebesgue differentiation theorem (2013) — 48 citations
• Medvedev degrees of two-dimensional subshifts of finite type (2012) — 64 citations