My implementation of M-I-U, more than 30 years ago, as a kid, in Turbo Pascal.<p><a href="https://github.com/ehud/MIU" rel="nofollow">https://github.com/ehud/MIU</a>
For those not in the know, the first book ever bought from Amazon was Douglas Hofstadter's "Fluid Concepts and Creative Analogies : Computer Models of the Fundamental Mechanisms of Thought"
Here is an introduction to the MIU formal system for someone who hasn't read GEB.<p><a href="https://sirodoht.xyz/blog/the-miu-formal-system/" rel="nofollow">https://sirodoht.xyz/blog/the-miu-formal-system/</a>
On a related note, if you are interested in learning more about Godel and the Incompleteness Theorem and its significance, I recommend the book Incompleteness by Rebecca Goldstein.
Here's some more Python related to the book (by a coworker):<p><a href="https://github.com/Quuxplusone/TNT" rel="nofollow">https://github.com/Quuxplusone/TNT</a>
I once did an introductory talk to Agda that was structured around solving the MU problem, i.e. proving that MU is not derivable in MIU: <a href="https://unsafePerform.IO/projects/agda/sg-meetup/SGMeetup.pdf" rel="nofollow">https://unsafePerform.IO/projects/agda/sg-meetup/SGMeetup.pd...</a>
(the MIU bit starts in Part III, slide 46)