- #1
infoman
- 1
- 0
I would like to start a discussion that summarizes the main computational challenges regarding Turing machines, so my question is: what are the current computational problems which are widely recognized do not have any efficient solution in a probabilistic turing machine.
Maybe you can answer this just giving a reference.
Maybe you can answer this just giving a reference.
Last edited: