Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Jason Rute"'
Autor:
THOMAS HALES, MARK ADAMS, GERTRUD BAUER, TAT DAT DANG, JOHN HARRISON, LE TRUONG HOANG, CEZARY KALISZYK, VICTOR MAGRON, SEAN MCLAUGHLIN, TAT THANG NGUYEN, QUANG TRUONG NGUYEN, TOBIAS NIPKOW, STEVEN OBUA, JOSEPH PLESO, JASON RUTE, ALEXEY SOLOVYEV, THI HOAI AN TA, NAM TRUNG TRAN, THI DIEP TRIEU, JOSEF URBAN, KY VU, ROLAND ZUMKELLER
Publikováno v:
Forum of Mathematics, Pi, Vol 5 (2017)
This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project.
Externí odkaz:
https://doaj.org/article/0dae9a3d3e584c73a937daefc20afe3b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 4 (2014)
We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given. Such points
Externí odkaz:
https://doaj.org/article/40ad0e55687f4ff6a0c32c93a0aea240
Publikováno v:
Journal of Logic and Analysis, Vol 4, Iss 0 (2012)
Externí odkaz:
https://doaj.org/article/d6ae813f1af34ad19b5bb7cfabcf3399
Autor:
Jason Rute
Publikováno v:
Algorithmic Randomness
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2837b969b6c3550a10ae2d3fc0030b63
https://doi.org/10.1017/9781108781718.004
https://doi.org/10.1017/9781108781718.004
Autor:
Mathieu Hoyrup, Jason Rute
Publikováno v:
Handbook of Computable Analysis
Handbook of Computable Analysis, In press
Handbook of Computable Analysis, pp.227-270, 2021, 978-3-030-59234-9. ⟨10.1007/978-3-030-59234-9_7⟩
Theory and Applications of Computability ISBN: 9783030592332
Handbook of Computable Analysis, In press
Handbook of Computable Analysis, pp.227-270, 2021, 978-3-030-59234-9. ⟨10.1007/978-3-030-59234-9_7⟩
Theory and Applications of Computability ISBN: 9783030592332
International audience; We provide a survey of recent results in computable measure and probability theory, from both the perspectives of computable analysis and algorithmic randomness, and discuss the relations between them.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7ac22eaf57fddc53825796948a32f89
https://hal.inria.fr/hal-02938919/file/Chapter_HR.pdf
https://hal.inria.fr/hal-02938919/file/Chapter_HR.pdf
Autor:
Jason Rute
Publikováno v:
Information and Computation. 258:50-78
This paper explores a novel definition of Schnorr randomness for noncomputable measures. We say x is uniformly Schnorr μ-random if t ( μ , x ) ∞ for all lower semicomputable functions t ( μ , x ) such that μ ↦ ∫ t ( μ , x ) d μ ( x ) is c
Autor:
Roland Zumkeller, Ky Khac Vu, Joseph Pleso, Tobias Nipkow, Truong Le Hoang, Truong Quang Nguyen, Sean McLaughlin, Steven Obua, Jason Rute, An Hoai Thi Ta, Mark Adams, Alexey Solovyev, Thang Tat Nguyen, Trung Nam Tran, Cezary Kaliszyk, Dat Tat Dang, John Harrison, Victor Magron, Gertrud Bauer, Diep Thi Trieu, Josef Urban, Thomas C. Hales
Publikováno v:
Forum of Mathematics. Pi, 5, 1-29
Forum of Mathematics. Pi, 5, pp. 1-29
Forum of Mathematics, Pi
Forum of Mathematics. Pi, 5, pp. 1-29
Forum of Mathematics, Pi
This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project.
Publikováno v:
LICS
We define a represention of conditional independence in terms of products of probability kernels, and ask when such representations are computable. We pursue this question in the context of exchangeable sequences and arrays of random variables, which
Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-��, ��]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3256d689013f25f3284c7745418a4ef7
Autor:
Jason Rute
A result of Shen says that if $F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$ is an almost-everywhere computable, measure-preserving transformation, and $y\in2^{\mathbb{N}}$ is Martin-L\"of random, then there is a Martin-L\"of random $x\in2^{\mathbb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eeb4eb10489d42e1c382b822295fa469