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)
• Advanced Docker for Enterprise Operations (in London on 23rd - 24th September 2019)
• µCon London 2020 - The Conference on Microservices, DDD & Software Architecture (in London on 27th - 29th May 2020)
• Running Stateful Applications in Kubernetes (in London on 5th September 2019)
• 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)
• ProgNET London 2019 (in London on 11th - 13th September 2019)
• CloudNative London 2019 (in London on 25th - 27th September 2019)
• London Reinforcement Learning August (in London on 22nd August 2019)
• You got served: How Deliveroo improved the ranking of restaurants (in London on 27th August 2019)
• Lightening talk: Redis Modules (SkillsCast recorded in July 2019)
• A Machine That Predicts the Global Economy in Real-Time (SkillsCast recorded in July 2019)