Lot's of people know about Turing Machines and the Lambda Calculus and that they both can express any computable function, but often don't really understand what that means. An Unlimited Register Machine is a simple model of a computer, still quite idealised, that is turing equivalent also.
The philosopher Dan Dennett, in his recent book Intuition Pumps and Other Tools For Thinking, devotes a rather large section to URMs titled The Seven Secrets Of Computing Power Revealed.
I will demo a DSL, that is an interesting use of higher order functions, for a kind of URM . The hope is that by simulating the simplest possible register machine and building up complex algorithms you can understand what it means to compute, how a computer works and along the way we will prove the undecidability of the Halting Problem.
YOU MAY ALSO LIKE:
- The Genuine Sieve of Eratosthenes (SkillsCast recorded in September 2015)
- Leonardo De Marchi's Deep Learning Fundamentals (in London on 22nd - 23rd October 2019)
- Brian Sletten's Data Science with Python Workshop (in London on 18th - 20th November 2019)
- Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
- Practical ML 2020 (in London on 2nd - 3rd July 2020)
- Countdown to Big Data LDN (in London on 17th October 2019)
- Reinforcement Learning Journal Club (in London on 17th October 2019)
- Using Kubeflow Pipelines for building machine learning pipelines (SkillsCast recorded in September 2019)
- Unleashing the Power of AI on projects; why we need to change culture (SkillsCast recorded in September 2019)
Unlimited Register Machines
Doing a mixture of Dev and Ops that might be called DevOps. Tom is a mathematician, theatre fan, occasional mountaineer, part time runner, thoroughly nice chap and available in fine bookstores everywhere.