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)
- Fast Track to Machine Learning with Louis Dorard (in London on 15th - 17th July 2019)
- Leonardo De Marchi's Deep Learning Fundamentals (in London on 22nd - 23rd October 2019)
- Infiniteconf 2019 - A one-day community celebration of Big Data, Machine Learning and AI (in London on 4th July 2019)
- London TensorFlow.js (in London on 20th June 2019)
- Keynote by Dick Wall on Why API Design Matters, and Why Yours Sucks! (and mine sucks too!) (in London on 24th June 2019)
- Accessing Snap ML (SkillsCast recorded in June 2019)
- Snap Machine Learning (SkillsCast recorded in June 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.