I was reading this question over on the quantum computation stackexchange, and the top answer stated that you can't (strongly) simulate even a probabilistic turing machine, on itself. I was just curious if there are any computational models (that are probabilistic) that can be strongly simulated by themselves. If there is, what would it look like?

Strong simulation based on the link I provided is explained here:

We can strongly simulate a machine if we can estimate the probability of measuring some fixed output - all zeroes, say - at the end to within some fixed relative error.



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.