Home

Welcome to the London Computation Club wiki!

Here you can find write-ups of our past meetings and propose topics for future ones.

• Home
• Call for Proposals
• Computation Pub Memorandum
• Hosting a conference

Meetings

Organisation

• Starting a meeting
• Running a retrospective

Choosing a Topic

• 21st May 2010
• 21st November 2017 - What to do from Jan 2018?
• 17th January 2017
• 8th September 2015

Shows & Tells

• Raytracing Show and Tell
• Festive Show & Tell 2018
• Festive Show & Tell 2017

Miscellaneous

• Sentient Beta Launch
• Computer Music Workshop
• Cryptography, Padding Oracles
• Lambda Calculus
• The Shunting-Yard Algorithm
• Parser Combinators
• Bletchley Park
• Coroutines explained
• HyperLogLog in 15 minutes

7 More Languages in 7 Weeks

• Lua, Day 1: The Call to Adventure
• Lua, Day 2: Tables All the Way Down
• Lua, Day 3
• Factor, Day 1: Stack On, Stack Off
• Factor, Day 2: Painting the Fence
• Factor, Day 3: Balancing on a Boat
• Elm, Day 1: Handling the Basics
• Elm, Day 2: The Elm Architecture
• Elm, Day 3: The Elm Architecture
• Elixir, Day 1: Laying a Great Foundation
• Elixir, Day 2: Controlling Mutations
• Elixir, Day 3: Spawning and Respawning
• Julia, Day 1: Resistance Is Futile
• Julia, Day 2: Getting Assimilated
• Julia, Day 3: Become One With Julia
• Minikanren, Days 1-3
• Minikanren, Einstein's Puzzle
• Idris Days 1-2

Types and Programming Languages

• Chapter 1: Introduction
• Chapter 2: Mathematical Preliminaries
• Chapter 3: Untyped Arithmetic Expressions
• Chapter 4: An ML Implementation of Arithmetic Expressions
• Chapter 5: The Untyped Lambda-Calculus
• Chapters 6 & 7: De Bruijn Indices and an ML Implementation of the Lambda-Calculus
• Chapter 8: Typed Arithmetic Expressions
• Chapter 9: The Simply-Typed Lambda Calculus
• Chapter 10: An ML Implementation of Simple Types
• Chapter 11: Simple Extensions
• Chapter 11 Redux: Simple Extensions
• Chapter 13: References
• Chapter 14: Exceptions
• Chapter 15: Subtyping – Part 1
• Chapter 15: Subtyping – Part 2
• Chapter 16: The Metatheory of Subtyping
• Chapter 16: Implementation
• Chapter 18: Case Study: Imperative Objects
• Chapter 19: Case Study: Featherweight Java

The New Turing Omnibus

Table of Contents

• Chapter 11: Search Trees
• Chapter 8: Random Numbers
• Chapter 35: Sequential Sorting
• Chapter 58: Predicate Calculus
• Chapter 27: Perceptrons
• Chapter 9: Mathematical Research
• Chapter 16: Genetic Algorithms
• Chapter 37: Public Key Cryptography
• Chapter 6: Game Trees
• Chapter 5: Gödel's Theorem
• Chapter 34: Satisfiability (also featuring: Sentient)
• Chapter 44: Cellular Automata
• Chapter 47: Storing Images
• Chapter 12: Error-Correcting Codes
• Chapter 32: The Fast Fourier Transform
• Chapter 36: Neural Networks That Learn
• Chapter 41: NP-Completeness
• Chapter 55: Iteration and Recursion
• Chapter 19: Computer Vision
• Chapter 61: Searching Strings
• Chapter 66: Church's Thesis
• Chapter 52: Text Compression
• Chapter 22: Minimum spanning trees
• Chapter 64: Logic Programming
• Chapter 60: Computer Viruses
• Show & Tell
• Errata

Elements of Computing Systems

• Chapter 1: Boolean Logic
• Chapter 2: Boolean Arithmetic
• Chapter 3: Sequential Logic
• Chapter 4: Machine Language
• Chapter 5: Computer Architecture
• Chapter 5b
• Chapter 6: Assembler
• Chapter 7: VM I: Stack Arithmetic
• Chapter 7b
• Chapter 8: VM II: Program Control
• Chapter 9: High-Level Language
• Chapter 10: Compiler I: Syntax Analysis
• Chapter 10b
• Chapter 11: Compiler II: Code Generation
• Chapter 11b
• Chapter 11c
• Chapter 12: Operating System
• Retrospective