question archive Construct a Probabilistic Turing Machine (PTM) M and an input word w ∈ {0, 1}∗ that has the following properties M has at least 5 states, including the initial, accepting and rejecting states, — M has a non-terminating computation on your chosen input w, — The expected termination time E [T ] of M on input w is finite
Construct a Probabilistic Turing Machine (PTM) M and an input word w ∈ {0, 1}∗ that has the following properties M has at least 5 states, including the initial, accepting and rejecting states, — M has a non-terminating computation on your chosen input w, — The expected termination time E [T ] of M on input w is finite
Subject:Computer SciencePrice: Bought3
Construct a Probabilistic Turing Machine (PTM) M and an input word w ∈ {0, 1}∗ that has the following properties
M has at least 5 states, including the initial, accepting and rejecting states, — M has a non-terminating computation on your chosen input w,
— The expected termination time E [T ] of M on input w is finite.
(ii) What is the probability of our proposed machine M accepting your proposed input word w? i.e what is Prob (M (w) = 1)?
