Hello smart people,(adsbygoogle = window.adsbygoogle || []).push({});

I am wondering if there is a process to convert a function to a Turing Machine. In other words, if I provide a list of input strings , and a corresponding output string for each input string, is there a way to find the minimum number of instructions to realize any function as a Turing Machine? Instructions can be either

<state,symbol,state_new,action> where action is new_symbol or move (left or right)

OR

<state,symbol,state_new,symbol_new,move> where move is left or right

If you could point me to resources, or provide the process in an algorithm I would be very happy. If this is a stupid question, or has already been solved in a previous post, I do apologize. Any help or direction is appreciated. Thanks.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Turing Machine Functions

Loading...

Similar Threads - Turing Machine Functions | Date |
---|---|

Uploading a Database to another Machine | Dec 8, 2017 |

Quantum Machine Learning Finds the Higgs in the Haystack | Oct 26, 2017 |

On Turing Machines | May 18, 2017 |

Symbol in Alan Turing's On Computable Numbers | Jan 21, 2015 |

Is it theoretically possible to simulate a quantum computer by a real (Turing) one. | Oct 28, 2005 |

**Physics Forums - The Fusion of Science and Community**