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.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A nondeterministic computing apparatus, composing: One or more computers, and One or more nondeterministic computing components. 2. The said nondeterministic computing component of claim [1], composing: Zero, one or more translators to transform other equivalent nondeterministic computations into the format of a nondeterministic Turing machine (NDTM) M as disclosed in the present invention, and/or A nondeterministic Turing machine (NDTM) M, in the format, but not limited to, as disclosed in the present invention, and An input X to M, in the format, but not limited to, as disclosed in the present invention, and A NDTM simulator for M on input X, as disclosed in one embodiment of the present invention, or its equivalent transformation into any of other nondeterministic Turing machines or any of other equivalents in different grammar and/or in different encoding. 3. A relational model and their equivalents for nondeterministic Turing machine M on an input X, composing: Events, as entities, each in the format, but not limited to, (t, h, q, y, d) representing the instantaneous changes that M enters next state q, writes symbol y in cell h, and then shifts the tape head from cell h to cell h+d at step t, where d is −1 or +1 for directions left and right, respectively, as disclosed in one embodiment of the present invention, and Trievents, as a relation, each in the format of, but not limited to, (w, p, c) representing both a move of M and its relationships to other moves by three events w, p, and c such that (p·q, w·t, c·q, c·y, c·d) is in the transition relation of M, as disclosed in one embodiment of the present invention, and A deterministic computation of time complexity t (or t-computation) of M on X represented in the format of a sequence of t+1 events or t+1 trievents, as disclosed in one embodiment of the present invention, and All the deterministic computations of time complexity t (or all t-computations) of M on X represented as a set of trievents, as disclosed in one embodiment of the present invention. 4. Any demoralized model of the said relational model in claim [3] including, but not limited to, using or interpreting t as a computer clock click count, and/or using or interpreting h as a computer memory location and/or storage location. 5. A method to determine whether nondeterministic Turing machine M accepts its input X, composing: An assumption of an event in a set of trievents by deleting trievents, as disclosed in one embodiment of the present invention and A hypothesis of a trievent in a set of trievents by deleting trievents, as disclosed in one embodiment of the present invention, and One or more of the said assumptions and/or one or more of the said hypotheses in one or more combinations in any order in the calculation of trievents of M on X, as disclosed in one embodiment of the present invention, and The use of a necessary and sufficient condition limΨ(P)=φ or its equivalents to check whether there is a t-computation in an arbitrary set P of trievents after zero or one or more assumptions, or after zero or one or more hypotheses, or after their combinations in any order, as disclosed in one embodiment of the present invention. 6. A method for finding a specific event sequence, or a specific t-computation, or their equivalents, in a subset P of R(0)∪ . . . ∪R(t) or its equivalent, for a nondeterministic Turing machine M on input X as disclosed in one embodiment of the present invention.