Calculabilty and Complexity

Hey everyone,

I had a course named “Calculabilty and Complexity” last year and I implemented a Turing
Machine simulator using Pharo just to see how easy/hard it would be (it was quite easy 🙂 ).

I also wrote a little thing on medium about it [1] (I just took half an hour to review it and
I thought it was time to publish it).

Just announcing it in case it case someone need/is interested by this.

There is also a github repository for the source code [2].




Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: