2001
DOI: 10.1007/978-1-4471-0307-3
|View full text |Cite
|
Sign up to set email alerts
|

Exploring RANDOMNESS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
73
0
1

Year Published

2002
2002
2017
2017

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 87 publications
(74 citation statements)
references
References 0 publications
0
73
0
1
Order By: Relevance
“…First, 2 random elements are derived for each sun position, an azimuth and one altitude angle, and it appears that 1000 sun positions are not sufficient to create an even distribution. Second, random numbers used in computer programs are pseudo-random, which means they are a generated in a predictable fashion using a mathematical formula, which implies that the distribution of random numbers are not completely random (Chaitin 2001). This discrepancy between the 2 methods is almost impossible to detect by visual comparison (Fig.…”
Section: Comparison Of Methodsmentioning
confidence: 99%
“…First, 2 random elements are derived for each sun position, an azimuth and one altitude angle, and it appears that 1000 sun positions are not sufficient to create an even distribution. Second, random numbers used in computer programs are pseudo-random, which means they are a generated in a predictable fashion using a mathematical formula, which implies that the distribution of random numbers are not completely random (Chaitin 2001). This discrepancy between the 2 methods is almost impossible to detect by visual comparison (Fig.…”
Section: Comparison Of Methodsmentioning
confidence: 99%
“…Algorithmic Information Theory (see [2,3,1]) deals with random sequences over a finite (not necessarily binary) alphabet. A real number is random if its binary expansion is a binary random sequence; the choice of base is irrelevant (see [1] for various proofs).…”
Section: Varying Alphabets and The Cantor Expansionmentioning
confidence: 99%
“…Similarly, as seen below, if an m-ary string is considered to be highly random (in naïve but intuitive terms, for now), it will not be too regular. For an alternative and clearly dichotomic approach, see [2] and [1], for example.…”
Section: Introductionmentioning
confidence: 99%