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:22 | Roger Penrose – The Emperor’s New Mind and Shadows of the Mind01:57 | Meet Eric Holloway04:08 | Faster and faster computers and the Church-Turing thesis05:03 | Deterministic and Non-deterministic Turing Computation06:38 | The halting problem07:20 | Past states, future states, and the inability to be purposeful07:50 | Free will08:40 | Axioms09:50 | Gödel’s Incompleteness Theorem11:00 | Solomonoff Induction11:25 | Kolmogorov Complexity11:55 | Algorithmic Information Theory13:04 | Consciousness and Qualia14:00 | Ray Kurtzwell and transferring consciousnessAdditional Resources
Penrose, Roger and N. David Mermin, The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics (1990), 1214-1216.Penrose, Roger. Shadows of the Mind. Vol. 4. Oxford: Oxford University Press, 1994.Holloway, Eric and Robert Marks “Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable.” Artificial Intelligence and Soft Computing (Springer, Cham: 2018), pp. 395-404.