摘要 |
In the disclosed nondeterministic computing apparatus and methods, a user problem to be solved is represented as a nondeterministic Turing machine M with an input X to it. A method for deterministic simulation of M on X is disclosed, which performs assumptions and refutations. The disclosed method is the first deterministic method with polynomial time complexity in the worst case if the time complexity of M is of polynomial time complexity, where time complexity is measured as a function of the length of X. |