Turing Complete

P = computability is the cornerstone of P

SKK = I
SKK = I

The Relision system is now Turing complete. This is a good thing, but there is a crazy amount of work left to do. Right now only the simplest matching is performed to allow somewhat trivial lambda expressions to work.

The screenshot is probably not that impressive. What is going on?

Continue reading “Turing Complete”