Caricamento...
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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
National Academy of Sciences
2012
|
| Soggetti: | |
| Accesso 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 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|