Update
This commit is contained in:
		
							parent
							
								
									be8dd746a0
								
							
						
					
					
						commit
						63cb50ff64
					
				
					 1 changed files with 1 additions and 1 deletions
				
			
		|  | @ -8,7 +8,7 @@ TODO | |||
| 
 | ||||
| TODO | ||||
| 
 | ||||
| One of the most basic is the **[chi-squared ncept of our measure is following: for given N, we consider a sequence s more random if it gives a lower probability of us correctly predicting the next bit from the subsequencetest](chi_squared_test.md)** whose description can be found e.g. in the *Art of Computer Programming* book. TODO | ||||
| One of the most basic is the **[chi-squared test](chi_squared_test.md)** whose description can be found e.g. in the *Art of Computer Programming* book. TODO | ||||
| 
 | ||||
| { The following is a method I wrote about here (includes some code): https://codeberg.org/drummyfish/my_writings/src/branch/master/randomness.md, I am almost certainly not the first to invent this, but I haven't found what this is called, so for now I'm calling it "my" test, not implying any ownership of course :) If you know what this method is called, please send me a mail. ~drummyfish } | ||||
| 
 | ||||
|  |  | |||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue