The following pages link to Verónica Becher (Q235738):
Displaying 50 items.
- Perfect necklaces (Q308973) (← links)
- A polynomial-time algorithm for computing absolutely normal numbers (Q386000) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Normality and automata (Q494059) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- Irrationality exponent, Hausdorff dimension and effectivization (Q681473) (← links)
- Turing's unpublished algorithm for normal numbers (Q884468) (← links)
- Kolmogorov complexity for possibly infinite computations (Q1777368) (← links)
- Finite-state independence (Q1787949) (← links)
- Abduction as belief revision (Q1855234) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- On extending de Bruijn sequences (Q1944170) (← links)
- Normal numbers and finite automata (Q1945947) (← links)
- On the number of words with restrictions on the number of symbols (Q2078934) (← links)
- Insertion in constructed normal numbers (Q2146241) (← links)
- Normal numbers and nested perfect necklaces (Q2274407) (← links)
- Low discrepancy sequences failing Poissonian pair correlations (Q2311093) (← links)
- Finite-state independence and normal sequences (Q2424666) (← links)
- Random reals à la Chaitin with or without prefix-freeness (Q2456371) (← links)
- On simply normal numbers to different bases (Q2634869) (← links)
- Extending de Bruijn sequences to larger alphabets (Q2656349) (← links)
- Randomness and uniform distribution modulo one (Q2672239) (← links)
- (Q2752143) (← links)
- Characterization results for d-Horn formulas, or on formulas that are true on dual reduced products (Q2776457) (← links)
- The irrationality exponents of computable numbers (Q2790259) (← links)
- Turing’s Normal Numbers: Towards Randomness (Q2904391) (← links)
- On the normality of numbers to different bases (Q2922848) (← links)
- Randomness and halting probabilities (Q3416122) (← links)
- From index sets to randomness in ∅<sup>n</sup>: random reals and possibly infinite computations part II (Q3616346) (← links)
- (Q4546706) (← links)
- On the construction of absolutely normal numbers (Q4595439) (← links)
- Normal Numbers and Computer Science (Q4613551) (← links)
- (Q4799352) (← links)
- (Q4938878) (← links)
- On Absolutely Normal and Continued Fraction Normal Numbers (Q5015537) (← links)
- On a question of Mendès France on normal numbers (Q5084403) (← links)
- Completely uniformly distributed sequences based on de Bruijn sequences (Q5113681) (← links)
- Normal numbers with digit dependencies (Q5234494) (← links)
- M. Levin’s construction of absolutely normal numbers with very low discrepancy (Q5270840) (← links)
- Normal numbers and the Borel hierarchy (Q5415858) (← links)
- A computable absolutely normal Liouville number (Q5501153) (← links)
- Random reals and possibly infinite computations Part I: Randomness in ∅′ (Q5718694) (← links)
- Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization (Q5740666) (← links)
- Wadge hardness in Scott spaces and its effectivization (Q5740667) (← links)
- (Q5747388) (← links)
- A construction of a 𝜆-Poisson generic sequence (Q5879128) (← links)
- An example of a computable absolutely normal number (Q5958342) (← links)
- On simply normal numbers with digit dependencies (Q6057074) (← links)
- Poisson Generic Sequences (Q6154916) (← links)
- Extending de Bruijn sequences to larger alphabets (Q6321238) (← links)
