Papers by Verónica Becher
arXiv (Cornell University), Feb 1, 2017
arXiv (Cornell University), Jan 2, 2016
IX Congreso Argentino de Ciencias de la Computación, Oct 1, 2003
Proceedings of the American Mathematical Society, Oct 6, 2015
arXiv (Cornell University), May 9, 2018
Transactions of the American Mathematical Society, Nov 26, 2018
Mathematische Annalen, Apr 11, 2015
arXiv (Cornell University), Jun 28, 2019
HAL (Le Centre pour la Communication Scientifique Directe), Sep 24, 2021
arXiv (Cornell University), Apr 20, 2021
Fundamenta Mathematicae, 2014
We show that the set of absolutely normal numbers is Π 0 3-complete in the Borel hierarchy of sub... more We show that the set of absolutely normal numbers is Π 0 3-complete in the Borel hierarchy of subsets of real numbers. Similarly, the set of absolutely normal numbers is Π 0 3-complete in the effective Borel hierarchy.
Mathematika, Jul 14, 2023
Given an integer and a set of prime numbers, the set of Toeplitz numbers comprises all elements o... more Given an integer and a set of prime numbers, the set of Toeplitz numbers comprises all elements of [0, b[ whose digits in the base‐b expansion satisfy for all and . Using a completely additive arithmetical function, we construct a number in that is simply Borel normal if, and only if, . We then provide an effective bound for the discrepancy.
Bioinformatics, May 18, 2009
Dagstuhl Reports, 2012
Research on the notions of information and randomness has drawn on methods and ideas from computa... more Research on the notions of information and randomness has drawn on methods and ideas from computability theory and cumputational complexity, as well as core mathematical subjects like measure theory and information theory. The Dagstuhl seminar 12021 ``Computability, Complexity and Randomness'' was aimed to meet people and ideas in these areas to share new results and discuss open problems. This report collects the material presented during the course of the seminar.
Uniform distribution theory, May 31, 2022
arXiv (Cornell University), May 17, 2023
Theoretical Computer Science, Oct 1, 2007
Theoretical Computer Science, Jun 1, 2012
We present a measure of string complexity, called I-complexity, computable in linear time and spa... more We present a measure of string complexity, called I-complexity, computable in linear time and space. It counts the number of different substrings in a given string. The least complex strings are the runs of a single symbol, the most complex are the de Bruijn strings. Although the I-complexity of a string is not the length of any minimal description of the string, it satisfies many basic properties of classical description complexity. In particular, the number of strings with I-complexity up to a given value is bounded, and most strings of each length have high I-complexity.
Journal of Symbolic Logic, Mar 1, 2009
Notre Dame Journal of Formal Logic, 2005
Uploads
Papers by Verónica Becher