Class 53: Random Numbers

Held Monday, May 8, 2000

Overview

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

Notes

• Tomorrow is our last presentation. Joel will talk about Core Wars. The reading is a handout (by Dewdney :-).
• On Wednesday, you'll have your chance to evaluate the class. Attendance is required.

Contents

Summary

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