Загрузка...
A zoo of computable binary normal sequences
Historically there has been a virtual absence of constructive methods to produce broad classes of “certifiably random” infinite sequences, despite considerable interest in this endeavor. Previously, we proved a theorem that yielded explicit algorithms to produce diverse sets of normal numbers, reaso...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
National Academy of Sciences
2012
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3511067/ https://ncbi.nlm.nih.gov/pubmed/23125196 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1215998109 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|