Please log in to watch this conference skillscast.

In the 1840s Charles Babbage proposed, but never built, an entirely mechanical, Turing-complete computer that he called the Analytical Engine. The designs were sufficiently complete that Ada, Countess of Lovelace (among others), was able to design 'programs' for it; this also means that we can model its behaviour with a reasonable degree of accuracy. This talk describes some of the architectural features of the machine. Together with John, you will also model its behaviour in F# to the point where you can run some simple programs on the virtual machine.

YOU MAY ALSO LIKE:

• Functional Concurrency in .NET with C# and F# (in London on 9th - 10th September 2019)
• Fast Track to F# with Tomas Petricek & Phil Trelford (in London on 9th - 10th September 2019)
• ProgNET London 2019 (in London on 11th - 13th September 2019)
• Haskell eXchange 2019 (in London on 10th - 11th October 2019)
• F#unctional Londoners July (in London on 18th July 2019)
• London Clojurians August (in London on 6th August 2019)
• Scala 2.13 and Beyond! (SkillsCast recorded in April 2019)
• Introduction to Markov Chains in F# (SkillsCast recorded in April 2019)