Although this question is more theoretical than most of the threads in this rubric, it still seems to me to fit the description "Computer Science". If I am wrong, perhaps someone would tell me where the question belongs.(adsbygoogle = window.adsbygoogle || []).push({});

The question is as follows: After reading the descriptions of non-deterministic and of probabilistic Turing machines, it appears that one way to characterise the difference would be to say that the results of a probabilistic Turing machine follow the laws of probability, whereas the output of a non-deterministic computer follows no pattern. Is this correct?

Thank you.

**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!

# Probabilitstic versus non-deterministic Turing machines

Loading...

Similar Threads - Probabilitstic versus deterministic | Date |
---|---|

C/C++ question, const versus #define for defining array. | Sep 23, 2011 |

F77 versus ifort! | May 29, 2011 |

System library versus standard library | Sep 17, 2010 |

Deterministic time/space for an algorithm? | Oct 8, 2007 |

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