Noise, Oscillators and Algebraic Randomness
DOI: 10.1007/3-540-45463-2_17
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic and Analytic Randomness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 22 publications
0
7
0
Order By: Relevance
“…In conclusion, we have presented a detailed statistical analysis of the blocks appearing in the binary expansions of the Feigenbaum constants a and d for the logistic map [20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39]. Significant deviations from randomness are revealed, leading to the possibility that these constants correspond to non-normal binary numbers.…”
Section: Discussionmentioning
confidence: 96%
“…In conclusion, we have presented a detailed statistical analysis of the blocks appearing in the binary expansions of the Feigenbaum constants a and d for the logistic map [20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39]. Significant deviations from randomness are revealed, leading to the possibility that these constants correspond to non-normal binary numbers.…”
Section: Discussionmentioning
confidence: 96%
“…One must noted that the previous remark is in fact valid for all kind of model which can be constructed from a given set of experimental data as, in practice, this is impossible to have access to the full scale sequence (2) . A limit model can not and will never represent the reality of a phenomenon as we have no possibilities to select between different admissible models up to a given scale.…”
Section: 12mentioning
confidence: 99%
“…Using these notions, it is possible to select from a given symbol sequence a natural candidate with low complexity and representing the associated multiscale Okamoto's function in one of the previous family. We refer to the report of J-P. Allouche in [2] for more details and precise definition of these notions.…”
Section: Complexity Of Multiscalementioning
confidence: 99%
“…Definition [89]: the block complexity of a sequence with values in a finite alphabet is the function , where is the number of different blocks of length that occur in the sequence.…”
Section: Conservation Of Information In This Randommentioning
confidence: 99%