void4

Finding the smallest Turing machine for an(y) (essentially) undecidable theory

6

I wonder how many states such a machine might have From: https://en.wikipedia.org/wiki/Decidability_%28logic%29#Decidability_of_a_theory: > A consistent theory that has the property that every consistent extension is undecidable is said to be...

Just tried your library - very cool, thank you for creating and sharing it :) FYI, the example in the README only works if filename is completely uppercased: ```python pat,...