Okay, so if I have a turing machine so called M, is there a configuration alpha s beta which yields a configuration with state q? If it's decidable can someone explain the algorithm to proceed?(adsbygoogle = window.adsbygoogle || []).push({});

**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 machines and decidability

Loading...

Similar Threads for Turing machines decidability | Date |
---|---|

[Theoretical computer science] Regular Turing Machine undecidable proof | Aug 22, 2015 |

How the original Turing machine broke the enigma | Mar 16, 2015 |

Help explain this Turing machine notation | Oct 6, 2014 |

Turing machines and circuits | Apr 28, 2014 |

Question about turing machine | Sep 18, 2013 |

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