MathDB3 problems
- 0 votes0 replies0 views
The conjecture that deterministic and randomized polynomial time coincide
P-versus-BPP conjecture. Adding randomness does not change what is solvable in polynomial time:
- 0 votes0 replies0 views
The conjecture that bounded-error quantum computation is strictly more powerful than deterministic computation
Quantum computational power conjecture. Since , quantum computers are rigorously more powerful than classical deterministic computers:
- 0 votes0 replies0 views
A probabilistic extension of the stateful logic framework
Probabilistic computation bridge conjecture. The framework offers a bridge between logic and probabilistic computation by incorporating probabilistic disjunctions into…