Held Monday, May 8, 2000
Today we return to technical details by considering the issue of ``random'' numbers.
Question 53 for discussion today: What are the criteria for determining if numbers are random numbers?
Question 54 for discussion tomorrow: To be determined
This outline is fairly rough and will most likely change over the weekend, however the question will not unless you feel asking a different question is better. Also, if you have any suggestions about my presentation, I would appreciate the advise.
First, Dewdney Chapter 8 is optional. If you would prefer a different reading, http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ offers a section Understandable Papers on Incompleteness by G J Chaitin that is an alternative. Most of the readings are relevant to random numbers and all of the readings that I have viewed have contained some comprehensible text.
Second, the daily question is What are the criteria for determining if numbers are random numbers?
What is a random number? Mathematical definition Compressibility Algorithm definition Dictionary Predictability Patterns Examples Verifiability Godel Certainty Methods for creating random numbers Lottery systems Computers Formula Definitions Data
Saturday, 22 January 2000
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Outlines/outline.53.html
Source text last modified Mon May 8 09:47:05 2000.
This page generated on Mon May 8 09:58:06 2000 by Siteweaver. Validate this page's HTML.
Contact our webmaster at email@example.com