For many years I have looked for a compiler that converts an arbitrary program written in a high-level/human-readable programming language (binary variables, arrays, strings, subroutines, loops, conditionals etc) into a Turing machine with the states and state tables. Preferably as efficiently as possible. I built one of my own that is somewhat simple but still wonder-- has anyone built one, possibly for a paper? I would like to find/use one thats open source. The idea is to use it for some experimental TCS/mathematics research.
Related Q&A on experimental mathematics from this forum: