Give the state diagram for two (2) different Turing Machines that
compute non-trivial problems. Your machines should contain at least
30-40 productive and necessary states.

---

Request for Question Clarification by politicalguru-ga on 13 Jun 2003 08:22 PDT

Dear ENM, 

Your question requires extensive research and work. 

You are seeking detailed advice from a professional, yet your current
price of $2.00 will put only 75% of that ($1.50) into the Researcher's
pocket.
 
If you value this information highly, you might want to consider
reviewing the pricing guide, in order to get a better answer by
pricing the question accordingly, you could read 
http://answers.google.com/answers/pricing.html ; and you could also
check the pricing for similar questions that have been answered.

---

Clarification of Question by enm-ga on 17 Jun 2003 14:39 PDT

I have increased the pay to $8.00 I'm sure that's the best I  can do
as a jobless person. Moreover, if you know automata very well, it
shouldn't take you that long to do a perfect job - aproximately 10 -
15 minutes at most if you know what you are doing.

"state one:  Read non-trivial problem.
state two:   Open beer
state three: Ask friend to solve problem
state four:  If friend says yes, goto state 6, if friend says no goto
state five
state five:  Drink beer and terminate algorithm
state six:   Give friend beer
state seven: Wait for friend to solve problem
state eight: If friend solves problem, terminate else goto state two"

-M. Springer

I wish I could take credit for this cute satirical commentary, but I
can't...a friend of mine saw this question thread and wrote it off the
top of his head. :)

-GC

Hey
Define the problems u want to solve exactly - and i can try a state diagram.