Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Mathieu Hoyrup"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 24, Iss Proc. CCA 2010, Pp 7-18 (2010)
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010, Local stabili
Externí odkaz:
https://doaj.org/article/d9d511712ec9489b839aa17374874c0a
Autor:
DJAMEL EDDINE AMIR, MATHIEU HOYRUP
Computable analysis provides ways of representing points in a topological space, and therefore of defining a notion of computable points of the space. In this article, we investigate when two topologies on the same space induce different sets of comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9f52d3c233f4913ab200cf6deca1cb8
https://inria.hal.science/hal-03702999/file/article.pdf
https://inria.hal.science/hal-03702999/file/article.pdf
Autor:
Mathieu Hoyrup
Publikováno v:
Algorithmic Randomness
Algorithmic Randomness--Progress and Prospects
Johanna N. Y. Franklin; Christopher P. Porter. Algorithmic Randomness--Progress and Prospects, Cambridge University Press, pp.17, 2020, ⟨10.1017/9781108781718⟩
Algorithmic Randomness--Progress and Prospects
Johanna N. Y. Franklin; Christopher P. Porter. Algorithmic Randomness--Progress and Prospects, Cambridge University Press, pp.17, 2020, ⟨10.1017/9781108781718⟩
International audience; In this article we present the framework of layerwise computability. We explain the origin of this notion, its main features and properties, and we illustrate it with several concrete examples: decomposition of measures, rando
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1db9ce16a9235aef755300bb628e134e
https://doi.org/10.1017/9781108781718.005
https://doi.org/10.1017/9781108781718.005
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030514655
CiE
CiE
There are continuum many homeomorphism types of Polish spaces. In particular, there is a Polish space which is not homeomorphic to any computably presented Polish space. We examine the details of degrees of non-computability of presenting homeomorphi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf6f7d6a59c7ce204259a389c5e9d4a8
https://doi.org/10.1007/978-3-030-51466-2_16
https://doi.org/10.1007/978-3-030-51466-2_16
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:
Mathieu Hoyrup
Publikováno v:
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2017, Special Issue: Theoretical Aspects of Computer Science, 60 (3), ⟨10.1007/s00224-016-9737-6⟩
Theory of Computing Systems, 2017, Special Issue: Theoretical Aspects of Computer Science, 60 (3), ⟨10.1007/s00224-016-9737-6⟩
Theory of Computing Systems, Springer Verlag, 2017, Special Issue: Theoretical Aspects of Computer Science, 60 (3), ⟨10.1007/s00224-016-9737-6⟩
Theory of Computing Systems, 2017, Special Issue: Theoretical Aspects of Computer Science, 60 (3), ⟨10.1007/s00224-016-9737-6⟩
International audience; In computability theory many results state the existence of objects that in many respects lack algorithmic structure but at the same time are effective in some sense. Friedberg and Muchnik's answer to Post problem is one of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d8daea9d22658cc7e1c69cff4c27100
https://doi.org/10.1007/s00224-016-9737-6
https://doi.org/10.1007/s00224-016-9737-6
Publikováno v:
Theory of Computing Systems
Theory of Computing Systems, 2017, 61 (4), pp.1353-1375. ⟨10.1007/s00224-017-9791-8⟩
Theory of Computing Systems, Springer Verlag, 2017, 61 (4), pp.1353-1375. ⟨10.1007/s00224-017-9791-8⟩
Theory of Computing Systems, 2017, 61 (4), pp.1353-1375. ⟨10.1007/s00224-017-9791-8⟩
Theory of Computing Systems, Springer Verlag, 2017, 61 (4), pp.1353-1375. ⟨10.1007/s00224-017-9791-8⟩
International audience; Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to the image distribu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::724d0407dea261c53e55bbab4c3a330d
Autor:
Mathieu Hoyrup
Publikováno v:
Pursuit of the Universal ISBN: 9783319401881
CiE
Computability In Europe
Computability In Europe, Jun 2016, Paris, France. pp.115-123, ⟨10.1007/978-3-319-40189-8_12⟩
CiE
Computability In Europe
Computability In Europe, Jun 2016, Paris, France. pp.115-123, ⟨10.1007/978-3-319-40189-8_12⟩
International audience; Baire Category is an important concept in mathematical analysis. It provides a way of identifying the properties of typical objects and proving the existence of objects with specified properties avoiding explicit constructions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51615ff6779407d2c9746de0fbd29e45
https://doi.org/10.1007/978-3-319-40189-8_12
https://doi.org/10.1007/978-3-319-40189-8_12
Publikováno v:
CCA
Computability and Complexity in Analysis (CCA)
Computability and Complexity in Analysis (CCA), Jun 2010, Zhenjiang, China. pp.7-18, ⟨10.4204/EPTCS.24.6⟩
Electronic Proceedings in Theoretical Computer Science, Vol 24, Iss Proc. CCA 2010, Pp 7-18 (2010)
Computability and Complexity in Analysis (CCA)
Computability and Complexity in Analysis (CCA), Jun 2010, Zhenjiang, China. pp.7-18, ⟨10.4204/EPTCS.24.6⟩
Electronic Proceedings in Theoretical Computer Science, Vol 24, Iss Proc. CCA 2010, Pp 7-18 (2010)
International audience; A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [J. Avigad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c411a8ac40735a2ae6c405ecc25edb5c
https://doi.org/10.4204/eptcs.24.6
https://doi.org/10.4204/eptcs.24.6
Publikováno v:
Theoretical Computer Science. 410:2207-2222
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel–Cantelli lemma: given a sequence (constructive in some way) of sets Ai with effectively summable measures, there are computable points
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0082ca29d5d1c1dfeb0bd503949f5877
https://doi.org/10.1016/j.tcs.2009.02.010
https://doi.org/10.1016/j.tcs.2009.02.010