ACCEPTED
Please predict whether this patent is acceptable.PATENT ABSTRACT: A nondeterministic Turning machine (NTM) performs computations using a spatial binary enumeration system, a three-dimensional relation system, a simulated-human logic system, and a bijective-set memory system. The NTM may be used to perform a variety of computational tasks, such as multiple sequence alignment, factorization, and other nondeterministic polynomial algorithms in polynomial time. The NTM may be constructed by a deterministic Turing machine (DTM) using the four systems listed above.