What is an algorithm and could a computer ever perform a non-algorithmic task? Computers are getting faster, algorithms are getting more complex, and our computing power is growing. With all these advancements, are there limitations that computers can never overcome?

Show Notes

• 01:00 | Roger Penrose – The Emperor’s New Mind and Shadows of the Mind
• 01:30 | Meet Eric Holloway
• 04:03 | Faster and faster computers and the Church-Turing thesis
• 04:27 | Deterministic and Non-deterministic Turing Computation
• 06:08 | The halting problem
• 06:50| Past states, future states, and the inability to be purposeful
• 07:20 | Free will
• 08:10 | Axioms
• 09:20 | Gödel’s Incompleteness Theorem
• 10:30 | Solomonoff Induction
• 10:55 | Kolmogorov Complexity
• 11:30 | Algorithmic Information Theory
• 12:40 | Consciousness and Qualia
• 13:40 | Ray Kurtzwell and transferring consciousness

• 01:00 | Eric Holloway Introduction
• 16:20 | Fold It, a showdown between AI and amateurs
• 18:10 | Jay Richards on crowd-sourcing bean counting in The Human Advantage
• 19:45 | Creativity and Solmonoff Induction
• 20:05 | Amazon Turk, or “where you get your crowd”
• 20:55 | Algorithms of the gaps and people in the loop
• 24:25 | What Jobs Are Safe From AI?
• 26:15 | Moravec Paradox
• 27:20| Singularity
• 27:51 | Sigmoid Curve
• 28:25 | The Journal of Irreproducible Results
• 29:00 | The A.I. Peak
• 29:45| Moore’s Law
• 20:30 | Future Forecast