A polynomial-time algorithm for computing absolutely normal numbers
- Autores
- Becher, Veronica Andrea; Heiber, Pablo Ariel; Slaman, Theodore A.
- Año de publicación
- 2013
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- We give an algorithm to compute an absolutely normal number so that the first n digits in its binary expansion are obtained in time polynomial in n; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.
Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Slaman, Theodore A.. University Of California Berkeley; Estados Unidos - Materia
-
Normal Numbers
Absolutely Normal Numbers
Computable Normal Numbers - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/15636
Ver los metadatos del registro completo
id |
CONICETDig_990557b1e9011ce797afee4ada6f43d7 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/15636 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
A polynomial-time algorithm for computing absolutely normal numbersBecher, Veronica AndreaHeiber, Pablo ArielSlaman, Theodore A.Normal NumbersAbsolutely Normal NumbersComputable Normal Numbershttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We give an algorithm to compute an absolutely normal number so that the first n digits in its binary expansion are obtained in time polynomial in n; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Slaman, Theodore A.. University Of California Berkeley; Estados UnidosElsevier Inc2013-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/15636Becher, Veronica Andrea; Heiber, Pablo Ariel; Slaman, Theodore A.; A polynomial-time algorithm for computing absolutely normal numbers; Elsevier Inc; Information And Computation; 232; 11-2013; 1-90890-5401enginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.ic.2013.08.013info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0890540113000904info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:51:58Zoai:ri.conicet.gov.ar:11336/15636instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:51:58.898CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
A polynomial-time algorithm for computing absolutely normal numbers |
title |
A polynomial-time algorithm for computing absolutely normal numbers |
spellingShingle |
A polynomial-time algorithm for computing absolutely normal numbers Becher, Veronica Andrea Normal Numbers Absolutely Normal Numbers Computable Normal Numbers |
title_short |
A polynomial-time algorithm for computing absolutely normal numbers |
title_full |
A polynomial-time algorithm for computing absolutely normal numbers |
title_fullStr |
A polynomial-time algorithm for computing absolutely normal numbers |
title_full_unstemmed |
A polynomial-time algorithm for computing absolutely normal numbers |
title_sort |
A polynomial-time algorithm for computing absolutely normal numbers |
dc.creator.none.fl_str_mv |
Becher, Veronica Andrea Heiber, Pablo Ariel Slaman, Theodore A. |
author |
Becher, Veronica Andrea |
author_facet |
Becher, Veronica Andrea Heiber, Pablo Ariel Slaman, Theodore A. |
author_role |
author |
author2 |
Heiber, Pablo Ariel Slaman, Theodore A. |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Normal Numbers Absolutely Normal Numbers Computable Normal Numbers |
topic |
Normal Numbers Absolutely Normal Numbers Computable Normal Numbers |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
We give an algorithm to compute an absolutely normal number so that the first n digits in its binary expansion are obtained in time polynomial in n; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality. Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Heiber, Pablo Ariel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Slaman, Theodore A.. University Of California Berkeley; Estados Unidos |
description |
We give an algorithm to compute an absolutely normal number so that the first n digits in its binary expansion are obtained in time polynomial in n; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-11 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/15636 Becher, Veronica Andrea; Heiber, Pablo Ariel; Slaman, Theodore A.; A polynomial-time algorithm for computing absolutely normal numbers; Elsevier Inc; Information And Computation; 232; 11-2013; 1-9 0890-5401 |
url |
http://hdl.handle.net/11336/15636 |
identifier_str_mv |
Becher, Veronica Andrea; Heiber, Pablo Ariel; Slaman, Theodore A.; A polynomial-time algorithm for computing absolutely normal numbers; Elsevier Inc; Information And Computation; 232; 11-2013; 1-9 0890-5401 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ic.2013.08.013 info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0890540113000904 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier Inc |
publisher.none.fl_str_mv |
Elsevier Inc |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1842269127704576000 |
score |
13.13397 |