Verónica Becher
vbecher@dc.uba.ar
Profesora Asociada
Departamento de Computación
Facultad de Ciencias Exactas y Naturales
Universidad de Buenos Aires
Pabellón I, Ciudad Universitaria, (1428) Buenos Aires, ARGENTINA.
Tel. (+54) (11) 4576 3390
Responsible of 
group
Area: theoretical computer science, program-size
complexity, algorithmic randomness, problems on words.
Chercheur étranger de la Mairie de Paris en qualité de senior
CNRS et Université Paris 7 - Laboratoire d'Informatique Algorithmique:
Fondements et Applications (LIAFA) et Équipe de logique mathématique,
November 2008 to February 2009.
Teaching in 2010
Algoritmos y Estructuras de Datos I
Current Projects
Binational project Argentina-France SECyT-INRIA/CNRS, FRIC08/01,
Laboratoire d'Informatique Algorithmique:
Fondements et Applications (LIAFA) CNRS - Université Paris 7, Denis Diderot.
Verónica Becher / Jean Eric Pin "Randomness and combinatorics on words", 2009-2010.
Programabilidad versus Computabilidad, PICT 2067,
Agencia Nacional de Promoción Científica y Tecnológica, 2008-2010.
UBACyT X098, 2008-2010.
Binational project Argentina-Spain,
AR2009-009,
"The Homogenization Dynamics of Eukaryotes Genomes",
joint with Hernan Dopazo, Príncipe Felipe, España, 2010-2011.
Publications
V.Becher, A.Deymonnaz, P.Heiber.
"Efficient repeat finding via suffix arrays", submitted 2009.
P. Barenbaum, V.Becher, A.Deymonnaz, M.Halsband, P.Heiber,
"Algorithms to find repeats within sets of strings", submitted 2009.
P. Barenbaum, V.Becher, A.Deymonnaz, M.Halsband, P.Heiber,
"Common and exclusive perfect repeats in large sets of genomic sequences,
with a study on nive vertebrates", submitted 2010.
V.Becher, P.Heiber, A.Deymonnaz.
"Efficient computation of all perfect repeats in genomic
sequences of up to half a Gigabyte, with a case study on
the Human genome.",
Bioinformatics 25(14):1746-1753, 2009.
V.Becher, S.Grigorieff.
"From index sets to randomness in \emptyset^n. Random reals and possibly infinite computations",
Journal of Symbolic Logic, 74:1, 124--156, 2009.
V. Becher, S. Grigorieff.
"Random reals a la Chaitin with or without prefix freeness",
Theoretical Computer Science 385, 193--201, 2007.
V.Becher, S.Figueira, R. Picchi.
"Turing's unpublished algorithm for normal numbers",
Theoretical Computer Science, Volume 377 , 126-138, 2007.
V.Becher, S.Figueira, S.Grigorieff, J.Miller.
"Randomness
and Halting Probabilities" , Journal of Symbolic Logic 71:4, pp.1411--1430, 2006.
V.Becher and S.Grigorieff. "Random
Reals and Possibly Infinite Computations. Part I: randomness in \emptyset'"
, Journal of Symbolic Logic, 70, 3, pp.891-913, 2005.
V.Becher, S.Figueira, A. Nies, S. Picchi. "Program
size complexity for possibly infinite computations", Notre Dame Journal of
Formal Logic 51-64, 2005.
V. Becher, S. Grigorieff. "Recursion
and Topology on 2^{\leq \omega} for possibly Infinite computations",
Theoretical Computer Science, 322 (1), pp. 85-136, 2004
V. Becher and S. Figueira, "Kolmogorov
Complexity for Possibly Infinite Computations", Journal of Logic Language
and Information, Volume 14, Number 2, 133 --148, 2005.
V. Becher and G. Chaitin, "Another
example of higher order randomness", Fundamenta Informaticae, Vol. 51:4, .
325--338, 2002.
V. Becher and S. Figueira, "An
example of a computable absolutely normal number", Theoretical Computer
Science, Vol.270, 947--958, 2002.
V. Becher, S.Daicz and G.Chaitin, "A
highly random number", Combinatorics, Computability and Logic, C.Calude, M.
J.Dineen and S.Sburlan (eds), Springer Verlag, London, 55--68, 2001.
V. Becher C.Areces, "Iterable AGM functions", Frontiers of Belief
Revision, H.Rott and M.Williams (eds),Kluwer, Dordrecht, 261--277, 2001.
V.Becher, C.Areces and S.Ferro, "Characterization Results for d-Horn
Formulas, or On formulas that are true on Dual Reduced Products". Logic,
Language and Computation, Volume 3, Cavedon, P.Blackburn, N.Braisby and A.
Shimojima.(eds), CSLI Publications, 49--66, 2000.
V. Becher and C.Areces, "Update, the infinite case", Proceedings of the
Argentinean Workshop on Theoretical Computer Science, in the 28 Jornadas
Argentinas de Informáatica e Investigación Operativa (JAIIO), Buenos Aires,
September 1999.
V. Becher, Fermé, Lazzer, Rodriguez, Oller and Palau, "Some Observations
on Carlos Alchourrón's Theory of Defeasible Conditionals". Norms Logics and
Information Systems, P.Mc Namara and H. Prakken (eds), New Studies on Deontic
Logic and Computer Science, IOS Press, 219--230, 1999.
C. Boutilier and V. Becher, "Abduction
as Belief Revision", Journal of Artificial Intelligence, 77(1), 43--94.
1995.
This is the extended version of the conference paper "A Model of
Preferred Explanations", Eleventh National Conference on Artificial Intelligence
(AAAI93), Washington DC, 642--648, 1993.
V.Becher, "Two Conditional Logics for Defeasible Inference: A Comparison.
Preliminary Version", Lecture Notes in Computer Science; Notes in Artificial
Intelligence, J. Wainer, A. Carvalho A. (eds), Advances in Artificial
Intelligence. Springer Verlag, Berlin, 49--58, 1995.
V.Becher, "Unified Semantics for Revision and Update, or the Theory of
Lazy Update", Proceedings of the 24 Jornadas Argentinas de Informática e
Investigación Operativa (JAIIO), SADIO (eds). Buenos Aires, Argentina, 1995.
Talks and conferences
"A new efficient algorithm to find all DNA repeats with exact matching",
in 24th IFIP conference on System Modelling and Optimization, 27 - 31 July 2009 Buenos Aires, Argentina, 2009.
Invited seminar talk
"Perfect repeats in te human genome, an exhaustive but efficient computation", IBM Life Science, Watson Research, Newy York, July 22, 2009.
"Effective hard sets", with Serge Grigorieff,
Fourth International Conference in in Computability, Complexity and Randomness
29 June to July 3rd, 2009,
CIRM center at Lumniny, Marseille, France.
Invited seminar talk,
"Perfect repeats in te human genome,
an exhaustive but efficient computation",
IFIBYNE-CONICET,
Depto. Fisiología, Biología Molecular y Celular,
Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,
May 7, 2009.
Invited talk, "What do different chromosomes have in common?
An exhaustive but efficient computation",
Center for Genomic Regulation, Barcelona, España, January 27, 2009.
Invited seminar talk, "What do different chromosomes have in common?
An exhaustive but efficient computation", Instituto de Investigaciones
Príncipe Felipe, Valencia, España, January 23, 2009.
"Random reals from usual mathematical notions",
Computability, Complexity and Randomness", Nanjing China, 18 May 2008.
Invited talk "Wadge Hardness and Randomness"
at Seminar on Topological and Game Theoretic Aspects of infinite computations,
Schloss Dagstuhl, Wadern, Germany, June to 4 July 2008.
"Eulerian sequences in de Bruijn graphs",
talk at the Séminaire Complexité,
Logique et Informatique, Paris 7, LIAFA, Université
Paris Diderot, February 2008.
"Cycles in de Bruij graphs", talk in "Jouurné de 60 ans
de Serge Grigorieff, Université Paris Diderot, 15 janvier 2008.
"Números reales aleatorios", conferencia plenaria invitada,
Unión Matemática Argentina, FAMAF,
Universidad de Córdoba, 21 de septiembre de 2007.
"Turing's unpublished algorithm for normal numbers",
conferencia plenaria invitada, XIII Simposio Latinoamericano de
Lógica Matemática, Oaxaca México, 10 Agosto 2006.
"On the old problem of a definition of randomness useful in practice", charla invitada
Workshop on Effective randomness, Palo Alto, 7 al 10 de Agosto 2006.
"Turing's unpublished algorithm for normal numbers", Turing days, Bilgi Universitesi, Istambul,
27 May 2006.
Turing's unpublished algorithm for normal numbers", Seminar on Kolmogorov
Complexity and Applications, Schloss Dagstuhl, Enero 2006.
"Cornucopia of randomness", Meeting in honor of Joos Heintz's 60th birthday,
Third international workshop on seminumerical techniques
in polynomial equation solving,Buenos Aires, October 24-28, 2005.
"Old and new results in Program size complexity", LIAFA, Paris 7, France, March 2005.
"High Randomness in the spirit of Rice's theorem for computability",
Department of Mathematics and Computer Science, University of Victoria,
Wellington, New Zealand, Noviembre
2004.
"A conjecture on Randomness in the spirit of Rice's
theorem", XII Latin American Symposium on
Mathematical Logic, San Jos?, Costa Rica, 12-16 January
2004.
"Is Complexity reusable?" Primeras Jornadas Latinoamericanas de
Ingeniería y Desarrollo de Software.
Microsoft Argentina, Pabellón Blanco de La Rural, October 30, 2003.
Panelists: Verónica Becher, Yuri Gurevich , Joos
Heintz.
"Randomness and Infinite Computations", Seminar on Kolmogorov Complexity and Applications,
Dagstuhl, Wadern, Germany, April 2003.
"Program size complexity
in possibly infinite computations", with S. Figueira y A. Nies,
Workshop on Computability and Randomness, Ruprecht-Karls-Universitat Heidelberg,
Germany, April 2003.
"Randomness: solved and unsolved questions",
Ecole Normal Superieure, Paris, January 2002.
"On the Standard proof of randomnes", King's College, London, UK, January 2002.
"On the Standard proof of randomness", ILLC, University of Amsterdam, The
Netherlands, January 2002.
"A Highly Random Number", Discrete Mathematics and Theoretical Computer Science,
Constanta, Rumania, July 2001.
"Randomness and real numbers". CREA -Ecole Polytechnique, Paris, July 2001.
"Examples of higher order randomness", XIV Coloquio Latinoamericano de Algebra,
La Falda, Córdoba, Argentina, July 2001.
"El azar y los números reales". Dept.de Física, Facultad de Ciencias Exactas y Naturales,
Universidad de Buenos Aires, June 2001.
"El azar y los números reales", FAMAF, Universidad de Córdoba, Argentina, July
2001.
"Una Función de cambio Analítico", con Christian Durr, Workshop on Theory
Change and Theory of Conditionals, Buenos Aires, December 2001.
"Incompletitud y Azar", Sociedad Argentina de Análisis
Filosófico (SADAF), December 1998.
"A comparison between two defeasible conditionals in standard modal
logics", Coloquio de Filosofía Teórica, SADAF, July
1995.
"Unified semantics for Revision and Update", Department of Computer Science,
The University of British Columbia, January 1995.
Notes related to my research
The Omega
Man New Scientist, 10 de Marzo, 2001.
Omega,
entrevista con Gregory Chaitin, diario La Nación, Buenos Aires, 29
Abril, 2001.
Perfume
de Azar, nota en el diario Páagina 12, 13 de Julio 2002.
Números
casuales, Exactamente, revista de la Facultad de Ciencias Exactas y
Naturales, Diciembre 2003.
De
puzzles,soluciones y cuelgues de computadoras, Oficina de prensa -SEGBE,
Numero 593, año 16, 24
Octubre 2005
Reconstruyen un manuscrito histórico.
Es un problema matemático planteado por Alan Turing,
considerado el "padre" de la computación, por Nora Bär,
La Nación, 10 de julio de 2007.
Versión web .pdf
Versión diario .pdf
Con computadoras, analizan la estructura del genoma humano,
La Nación, 20 de Febrero de 2009.
Other
Golem's stomachs or a hippie dream?
Proyecto Golem 2005, bienal argentino-checa, Praga, 2 al 5 de Julio
2005.
Cuánto de Golem hay en las computadoras? Proyecto Golem 2003 ? 5764 Buenos
Aires-Praga. El Golem en la Religión y en las Artes y como Metáfora en las
Ciencias de la Computación. Museo Nacional de Bellas Artes. Buenos
Aires, 2 y 3 octubre 2003.
"Las Computadoras y el Azar", Facultad de Ciencias Exactas y Naturales, Semana de la
Computación, Octubre 2001.
We organized
Conference on Logic, Computability
and Randomness, January 10 to 13, 2007. Buenos Aires,
Argentina
Conference on Logic, Computability
and Randomness, September 20 to 24, 2004. Córdoba,
Argentina