Ludovic Patey

2015

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Whom Ludovic Patey trusts overall

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

  1. Theodore A. Slaman
  2. Stephen G. Simpson

Papers from Ludovic Patey's perspective

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

  1. THE METAMATHEMATICS OF STABLE RAMSEY'S THEOREM FOR PAIRS
  2. Algorithmic Randomness and Complexity (Theory and Applications of Computability)
  3. Ergodic Theory via Joinings
  4. A personal communication
  5. Computable Analysis (Conference on Computability in Europe)
  6. Computability and randomness
  7. Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
  8. Tilings
  9. On Computable Numbers, with an Application to the Entscheidungsproblem.
  10. An extension of the recursively enumerable Turing degrees

Their papers