Models of compute
Run Lambdas calculus, Turing machines and Finite State automotas!
Description
Created an interperter for different models of computation, each model of computation has a different format that can be specified.Experiences
- Learnt more about these models, how they are implemented and used.
- Gained experienced in Haskell, the language chosen for implemntation, and more on how functional programming works.
- More experience in reading and interperting formats using the Monadparsec library.
- Learnt how lambda calculus in particular could be used to do computations.
Todos
- Implement more models of computation, for example, using gates
- Implement a regex library as NFAs and DFAs are implemented
Tools used
Haskell
A purely functional programming language