Tell me more ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.
up vote 3 down vote favorite
1

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:

[1] reading list on experimental mathematics

[2] is experimental complexity theory being used to solve open problems

[3] experimental results in cs papers

share|improve this question
5  
You were told on CS theory to put some effort into spelling things correctly. This is not a chat room. yrs --> yours/years. Some capital letters at the start of sentences, etc. – Dave Clarke Jul 26 '12 at 20:07
1  
For a computability course I taught, I worked through an example of building progressively higher ans higher level langauges equivalent to Turing machines. It didn't end up at a very high level, but if you're curious what this might look like, the slides are available here: stanford.edu/class/archive/cs/cs103/cs103.1126/lectures/18/… – templatetypedef Jul 26 '12 at 22:14
3  
@DaveClarke Aren't you familiar with the concept of a bored student? They might have wanted to compile code for their Turing machine emulator programmed in Malbolge interpreted by an Unlambda program compiled for x86 and running in a virtual machine emulated in Javascript. – Gilles♦ Jul 26 '12 at 22:55
1  
I don't see how this question is about computer science. How to write such a compiler is on-topic, and we can help you if you have questions about it. But looking for a compiler is not a computer science question. It is to some extent a programming question, but Stack Overflow wouldn't want it, they don't like questions asking where to find a tool. – Gilles♦ Jul 26 '12 at 22:57
1  
disappointed at the hostile response so far. feel its an ok question even without further bkg beyond that already given. however will share the underlying motivation: automated theorem proving. will share more details if the question is unclosed – vzn Sep 11 '12 at 21:47
show 9 more comments

closed as off topic by Gilles♦ Jul 26 '12 at 22:57

Questions on Computer Science Stack Exchange are expected to relate to computer science within the scope defined in the FAQ. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about closed questions here.