Search:

battlebots robot combat build robot fighting robots robot weapons robot competition robot wars robot rumble



Gregory Chaitin Lecture Carnegie-Mellon University 2000 Pt 1

Robot Building and Competition Videos
Robot Building and Competition Videos Robot Building and Competition Videos
Robot Building and Competition Videos

School of Computer Science Distinguished Lecture, Carnegie-Mellon University, Pittsburg, Pennsylvania, 2000Historical Introduction --- A Century of Controversy Over the Foundations of MathematicsG.J. Chaitin's 2 March 2000 Carnegie Mellon University School of Computer Science Distinguished Lecture. The speaker was introduced by Manuel Blum. The lecture was videotaped; there is an edited transcript which appeared on pp. 12-21 of a special issue of Complexity magazine on ``Limits in Mathematics and Physics'' (Vol. 5, No. 5, May/June 2000). http://www.cs.auckland.ac.nz/~...

Channel: Howto & Style
Uploaded: July 28, 2006 at 9:17 pm
Author: pont660

Length: 08:59
Rating: 4.62
Views: 12258

Tags: Carnegie  Chaitin  constant  Gregory  Lecture  Mellon  omega  University  

Video Url:


Embed Code:

Video Comments

AmericanGurl123 (June 12, 2008 at 11:34 am)
you seem to have a problem differentiating between data and the underlying process which generates the data. A series of numbers is just data......
menkaur (January 10, 2008 at 12:56 pm)
terrible terrible sound
trombone7 (December 28, 2007 at 5:36 pm)
Cool. What do read? I've been reading "User Illusion" by Norretranders and flipping through "Decoding the Universe" by Seife
heloizyjhenifer (December 25, 2007 at 10:45 pm)
Sometimes something really random might look not as "random" as we'd like. Also if one tries to generate a string of random numbers mentally, there will be a definite bias very soon. You can think of Random as not-compressible-given-some-compression-algorithm. A compression algorithm shrinks a few strings and expands the huge remainder of them. The former are non random according to the algorithm.18446744073709551616 = 2^64
trombone7 (December 18, 2007 at 3:36 pm)
I've never been caught. My management is far too lazy to actually mathematically check. I just remember reading that trying to look random compared to true random is somehow discernible. So your top row isn't completely random ?
heloizyjhenifer (December 14, 2007 at 2:08 am)
haha nice, try to lie from the very begining next time, it might work better =).About my guess numbers, i can hint you that one of them has 1 and only 0's after that, in a certain base ;).
trombone7 (December 6, 2007 at 2:53 pm)
You're right. It isn't easy but it can be done. For instance, if you forget to write down your daily mileage for work and just try to make up all the numbers, they can tell.
heloizyjhenifer (November 20, 2007 at 6:30 am)
Okay, now which of those is more random :)1844674407370955161612345678901234567890Don't remember if Chaitin mentions in his book that proving randomness isn't an easy problem ^^.
MrWilburne (October 15, 2007 at 2:07 am)
T-T-T-T-Today Junior!!!
DrLight9 (June 2, 2007 at 3:10 am)
bless you , chaitin. i hated you at first and now i love you. always look for the string and always pull it. and always find more complexity and beauty. thank you.


Robot Building and Competition Videos © 2008 Logan Bot All Rights Reserved.