# Book

B. Monin, L. Patey Calculabilité

Calvage et Mounet

# Book Chapter

B. Monin Higher randomness

Lecture notes in logic : Algorithmic Randomness : Progress and Prospects, to appear

[PDF]

# Journal papers

B. Monin, L. Patey SRT22 does not imply COH omega-models

Advances in mathematics, 2021, vol. 389, p. 107903

[PDF]

B. Monin, L. Patey The weakness of the pigeonhole principle under hyperarithmetical reductions

Journal of Mathematical Logic, 2021, vol. 21, n. 03, p. 2150013, 41

[PDF]

L. Bienvenu, N. Greenberg, B. Monin Bad oracles in higher computability and randomness

Israel Journal of mathematics, 2021, vol. 241, p. 229–276

[PDF]

B. Monin, A. Nies Muchnik degrees and cardinal characteristics

Journal of Symbolic Logic, 4 sept. 2020, Accepted manuscript, p. 1-28.

[PDF]

B. Monin, L. Patey Pigeons do not jump high

Advances in Mathematics, 2019, vol. 352, p. 1066-1095

[PDF]

P.E. Angles d'Auriac, B. Monin Genericity and randomness with ITTMs

Journal of Symbolic Logic, 2019, vol. 84, p. 1670-1710

[PDF]

L. Liu, B. Monin, L. Patey A computable analysis of variable word theorems

Proceedings of the American Mathematical Society, 2019, vol. 147, p. 823-834

[PDF]

B. Monin, L. Patey Pi^0_1 encodability and omniscient reduction

Notre Dame Journal of Formal Logic, 2019 vol. 60, n. 01, p. 1-12

[PDF]

L. Bienvenu, S. Figueira, B. Monin, A. Shen Algorithmic identifiation of probabilities is hard

Journal of Computer and System Sciences, 2018, vol. 95, p. 98-108

[PDF]

N. Greenberg, J. Miller, B. Monin, D. Turetsky Two More characterizations of K-triviality

Notre Dame Journal of Formal Logic, 2018, vol. 59, n. 02, p. 189-195

[PDF]

N. Greenberg, B. Monin Higher randomness and genericity

Forum of mathematics, Sigma, 2017, vol. 5, e. 31

[PDF]

L. Bienvenu, N. Greenberg, B. Monin Continuous Higher randomness

Journal of Mathematical Logic, 2017, vol. 17, n. 01, p. 1750004

[PDF]

B. Monin Higher randomness and forcing with closed sets

Theory of computing system, 2017, vol. 60, n. 03, p. 421-437

[PDF]

# Conference papers

B. Monin An answer to the Gamma question

(formerly "Asymptotic density and error-correcting codes")
LICS 2018

Proceedings of the 33rd Annual IEEE Symposium on LICS, p. 730-738

[PDF]

P.E. Angles d'Auriac, B. Monin Another characterization of the higher K-Trivials

MFCS 2017

Leibniz international proceedings in informatics, vol. 83

[PDF]

B. Monin, A. Nies A unifying approach to the Gamma question

LICS 2015

Proceedings of the 30th Annual IEEE Symposium on LICS, p. 585-596

[PDF]

L. Bienvenu, B. Monin, A. Shen Algorithmic identifiation of probabilities is hard

ALT 2014

International Conference on Algorithmic Learning Theory, p. 85-95, Springer

[PDF]

B. Monin Higher randomness and forcing with closed sets

STACS 2014

Leibniz international proceedings in informatics, vol. 25

[PDF]

L. Bienvenu, B. Monin von Neumann's biased coin revisited

LICS 2012

Proceedings of the 27th Annual IEEE Symposium on LICS, p. 145-154

[PDF]

# Submitted

P-E Anglès d'Auriac, P. Cholak, D. Dzhafarov, B. Monin, L. Patey Milliken's tree theorem and its applications : a computability-theoretic perspective

[PDF]

B. Monin, L. Yu On the Borelness of upper cones of hyperdegrees

[PDF]

# Misc

Hdr Report : Mathias Forcing and the Ramsey theorem for pairs

[PDF]

PhD Report : Higher computability and randomness

[PDF]

Book in french (work in progress) : Calculabilité

[PDF]