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 Mind01:30 | Meet Eric Holloway04:03 | Faster and faster computers and the Church-Turing thesis04:27 | Deterministic and Non-deterministic Turing Computation06:08 | The halting problem06:50| Past states, future states, and the inability to be purposeful07:20 | Free will08:10 | Axioms09:20 | Gödel’s Incompleteness Theorem10:30 | Solomonoff Induction10:55 | Kolmogorov Complexity11:30 | Algorithmic Information Theory12:40 | Consciousness and Qualia13:40 | Ray Kurtzwell and transferring consciousness

01:00 | Eric Holloway Introduction16:20 | Fold It, a showdown between AI and amateurs18:10 | Jay Richards on crowd-sourcing bean counting in The Human Advantage19:45 | Creativity and Solmonoff Induction20:05 | Amazon Turk, or “where you get your crowd”20:55 | Algorithms of the gaps and people in the loop24:25 | What Jobs Are Safe From AI?26:15 | Moravec Paradox27:20| Singularity27:51 | Sigmoid Curve28:25 | The Journal of Irreproducible Results29:00 | The A.I. Peak29:45| Moore’s Law20:30 | Future Forecast