Patterns, Randomness and Information
author:
Gregory Chaitin,
University of Auckland
Description
Information, Complexity, Patterns, Randomness and Compression. And how these ideas can be traced back through Hermann Weyl to Leibniz in 1686, and connect them with Godel & Turing and with the question of how math compares & contrasts with physics and with biology.
You might be experiencing some problems with Your Video player.
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Visitors who watched this lecture also watched...
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




The audio doesn't work in the first recorded lecture!
Hello, the video file has been fixed and the flash file added, so enjoy the viewing.
enthused..yes
elegant...no
well worth the watch
however care is needed in slipping into "metamath'
a set of mathematicians is not a mathematician
...patternless in one language.. compressionable in another
random on one computer...not on another
But , it is all worthwhile