Is Mathematics Eternal? Pt. 1
Is Mathematics Eternal? Pt. 2
Very interesting conversation between Robert Kuhn and Gregory Chaitin, a mathematician and computer scientist at IBM's Thomas J Watson Research Center. The Research Center is renowned for it's eccentric employees, Nobel Prizes, and technological breakthroughs.
Gregory Chaitin's field is algorithmic information theory which is the focus of complexity on strings or other data structures. Informally, from the point of view of algorithmic information theory, the information content of a string is equivalent to the length of the shortest possible self-contained representation of that string. For example, a 3000 page encyclopedia contains less information than 3000 pages of completely random letters, even if the encyclopedia is more useful. The reason why 3000 pages of completely random letters contains more information is because to reconstruct it, you would have to know every single letter contained in the pages. A person with reason could reconstruct the encyclopedia if all the vowels were removed.