INVESTIGADORES
BECHER veronica Andrea
artículos
Título:
Recursion and Topology on finite and infinite words for possibly Infinite computations
Autor/es:
VERÓNICA BECHER; SERGE GRIGORIEFF
Revista:
THEORETICAL COMPUTER SCIENCE
Editorial:
ELSEVIER SCIENCE BV
Referencias:
Año: 2004 vol. 322 p. 85 - 136
ISSN:
0304-3975
Resumen:
In the context of possibly inÿnite computations yielding finite or infinite (binary) outputs, the set of of finite and infinite binary words appears to be one of the most fundamental spaces in Computer Science. Though underconsidered, next to the Cantor space, this space can be viewed as the simplest compact space native to computer science. In this paper we study some of its properties involving topology and computability.
