This web site exists to document my adventures in writing software emulators for old computer hardware. So far, I have completed (sort of) a Commodore PET emulation and am working on a Sinclair Spectrum emulation.
Recent Posts
L-Systems part 2 – Push and Pop
In my last post, I introduced the concept of an L-system (or Lindenmeyer system). An L-system is an alphabet of symbols, an axiom (which is a string of symbols from the alphabet) and a set of production rules that generate new strings from existing strings. We also talked about an alternative way to interpret the … Continue reading L-Systems part 2 – Push and Pop
L-Systems
An L-system, or Lindenmeyer system is a rewriting system for generating structured strings of symbols. The idea is named for Aristid Lindenmeyer who invented it to help him model the growth of algae and other simple organisms. An L-system consists of the following: In the simplest L-systems, each production rule is defined by a single … Continue reading L-Systems
Lambda Calculus: Finding Primes
It’s nearly two years since I wrote anything on this series – or anything else, so I think it is time to resurrect this blog. This post will be the last post discussing the traditional Lambda Calculus. We will be using the Lambda Calculus to find lists of primes using the Sieve of Eratosthenes. If … Continue reading Lambda Calculus: Finding Primes
Lambda Calculus: More Numbers
Recap In the last post not dealing with the internals of the Lambda Calculator, we introduced Church Numerals and some basic operations. There are actually only two operations that are needed and these are: isZero which is true if the number is zero and false otherwise succ which gives us the successor of any Church … Continue reading Lambda Calculus: More Numbers
Sincere Flattery 