Követés
Jason Rute
Jason Rute
IBM Research
E-mail megerősítve itt: ibm.com - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
A formal proof of the Kepler conjecture
T Hales, M Adams, G Bauer, TD Dang, J Harrison, H Le Truong, ...
Forum of mathematics, Pi 5, e2, 2017
4532017
Proof artifact co-training for theorem proving with language models
JM Han, J Rute, Y Wu, EW Ayers, S Polu
arXiv preprint arXiv:2102.06203, 2021
812021
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
J Avigad, ET Dean, J Rute
Annals of Pure and Applied Logic 163 (12), 1854-1864, 2012
402012
Oscillation and the mean ergodic theorem for uniformly convex Banach spaces
J Avigad, J Rute
Ergodic Theory and Dynamical Systems 35 (4), 1009-1027, 2015
342015
Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
K Miyabe, J Rute
Proceedings of the 12th Asian Logic Conference, 251-270, 2013
242013
Computable randomness and betting for computable probability spaces
J Rute
Mathematical Logic Quarterly 62 (4-5), 335-366, 2016
222016
Topics in algorithmic randomness and computable analysis
J Rute
Carnegie Mellon University, 2013
192013
Metastable convergence theorems
J Avigad, E Dean, J Rute
arXiv preprint arXiv:1108.4400, 2011
182011
Algorithmic randomness, martingales, and differentiability I
J Rute
preprint, 2012
172012
A formal proof of the Kepler conjecture (2015)
T Hales, M Adams, G Bauer, DT Dang, J Harrison, TL Hoang, C Kaliszyk, ...
Preprint arXiv 1501, 2015
142015
A formal proof of the Kepler conjecture. Forum of Mathematics, Pi 5 (2017)
T Hales, M Adams, G Bauer, TD Dang, J Harrison, LT Hoang, C Kaliszyk, ...
URL: https://doi. org/10.1017/fmp, 2017
92017
When does randomness come from randomness?
J Rute
Theoretical Computer Science 635, 35-50, 2016
92016
Computable measure theory and algorithmic randomness
M Hoyrup, J Rute
Handbook of Computability and Complexity in Analysis, 227-270, 2021
72021
On the computability of graphons
NL Ackerman, J Avigad, CE Freer, DM Roy, JM Rute
arXiv preprint arXiv:1801.10387, 2018
52018
On computable representations of exchangeable data
NL Ackerman, J Avigad, CE Freer, DM Roy, JM Rute
Workshop on Probabilistic Programming Semantics, 2017, 2017
52017
Algorithmic randomness for Doob's martingale convergence theorem in continuous time
B Kjos-Hanssen, PKLV Nguyen, J Rute
Logical Methods in Computer Science 10, 2014
52014
Graph2Tac: learning hierarchical representations of math concepts in theorem proving
J Rute, M Olšák, L Blaauwbroek, FIS Massolo, J Piepenbrock, V Pestun
arXiv preprint arXiv:2401.02949, 2024
42024
Algorithmic barriers to representing conditional independence
NL Ackerman, J Avigad, CE Freer, DM Roy, JM Rute
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2019
42019
Schnorr randomness for noncomputable measures
J Rute
Information and Computation 258, 50-78, 2018
42018
A formal proof of the Kepler conjecture. CoRR (2015)
TC Hales, M Adams, G Bauer, DT Dang, J Harrison, TL Hoang, C Kaliszyk, ...
arXiv preprint arXiv:1501.02155, 0
4
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20