Navegar

Colección

Datos Estadísticas

Lista de

Becher, Verónica Andrea
25
Theoretical Computer Science
6
"An example of a computable absolutely normal number" (2002) Becher, V.; Figueira, S. Theoretical Computer Science. 270(1-2):947-958
"Recursion and topology on 2≤ω for possibly infinite computations" (2004) Becher, V.; Grigorieff, S. Theoretical Computer Science. 322(1 SPEC ISS):85-136
"Random reals à la Chaitin with or without prefix-freeness" (2007) Becher, V.; Grigorieff, S. Theoretical Computer Science. 385(1-3):193-201
"Turing's unpublished algorithm for normal numbers" (2007) Becher, V.; Figueira, S.; Picchi, R. Theoretical Computer Science. 377(1-3):126-138
"A linearly computable measure of string complexity" (2012) Becher, V.; Heiber, P.A. Theoretical Computer Science. 438:62-73
"Normal numbers and finite automata" (2013) Becher, V.; Heiber, P.A. Theoretical Computer Science. 477:109-116