Symmetry and Uncountability of Computation

This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named “testing problem”. And I get some condition of the P complete and NP complete by using testing problem. Second, I make two problem “orderly problem” and “chaotic problem”. Orderly problem have some order structure. And DTM can limit some possible symbol effectly by using symmetry of each symbol. But chaotic problem must treat some symbol as a set of symbol, so DTM cannot limit some possible symbol. Orderly problem is P complete, and chaotic problem is NP complete. Finally, I clear the computation time of orderly problem and chaotic problem. And P != NP.

💡 Research Summary

The manuscript attempts to address the long‑standing P versus NP question by introducing a generic decision‑making framework called the “testing problem.” Within this framework the author seeks to characterize two subclasses of decision problems—named “orderly problems” and “chaotic problems”—based on the presence or absence of structural symmetry in the input data. The central claim is that orderly problems, which possess a well‑defined symmetry, can be solved by a deterministic Turing machine (DTM) in polynomial time and are therefore P‑complete, whereas chaotic problems lack such symmetry, must treat symbols as sets, and consequently require exponential‑time exploration, placing them in the NP‑complete class. By comparing the time complexities of these two families, the author concludes that P ≠ NP.

The paper begins by defining the “testing problem” as a generic decision problem: given an input, decide whether a certain property holds. This definition is essentially a restatement of the standard decision‑problem notion used throughout complexity theory, and the author does not provide a formal language or model that distinguishes it from existing concepts. The subsequent claim that the testing problem can be used to derive conditions for P‑completeness and NP‑completeness is not substantiated with rigorous reductions or formal proofs; instead, it is presented as an intuitive observation.

The next section introduces the two problem families. An “orderly problem” is described as one whose input symbols exhibit a regular order and a symmetry that can be exploited by a DTM to prune the search space. The author suggests that because symmetric symbols can be grouped or identified, the DTM can “limit possible symbols effectively,” thereby achieving polynomial‑time performance. However, the manuscript lacks any concrete algorithmic description of how this symmetry is detected, represented, or used to reduce the state space. No group‑theoretic formalism, equivalence‑class construction, or explicit reduction to a known P‑complete problem (such as CIRCUIT‑VALUE) is provided. Consequently, the assertion that orderly problems are P‑complete remains unproven.

Conversely, a “chaotic problem” is defined as one where symbols must be treated as sets, leading to an explosion of possible configurations. The author labels this phenomenon “uncountability,” borrowing terminology from set theory, but applies it to finite‑length strings, which is a misuse of the term. The manuscript argues that because a DTM cannot limit the possible symbols, the problem inevitably requires exponential time and thus belongs to NP‑complete. Yet, no reduction from a canonical NP‑complete problem (e.g., SAT, 3‑SAT, or CLIQUE) to a chaotic problem is shown. Moreover, the paper does not demonstrate that chaotic problems are in NP (i.e., that a polynomial‑size certificate exists and can be verified in polynomial time). The lack of formal reductions means the classification of chaotic problems as NP‑complete is speculative.

The “computation time analysis” section claims to have “cleared” the time complexities of both problem families. For orderly problems the author merely states that symmetry allows pruning, implying a polynomial bound, but no explicit big‑O expression or worst‑case analysis is given. For chaotic problems the author asserts an exponential blow‑up without quantifying it (e.g., O(2^n) or O(n!)). No rigorous proof, such as a lower‑bound argument based on decision‑tree complexity, is presented.

Finally, the paper concludes that because orderly problems are P‑complete and chaotic problems are NP‑complete, the two classes are distinct, establishing P ≠ NP. This conclusion is not logically valid. Proving P ≠ NP requires showing that no polynomial‑time algorithm exists for any NP‑complete problem, or equivalently, that there exists at least one language in NP that is not in P. Demonstrating that two specially constructed problem families fall into different classes does not suffice, especially when the classifications themselves are not rigorously proved.

In summary, the manuscript offers an interesting high‑level intuition: symmetry in data may enable efficient algorithms, while lack of structure may force exponential search. However, the work falls short of the standards required for a complexity‑theoretic contribution. The definitions are vague, the reductions are absent, and the central claim (P ≠ NP) is not supported by a formal proof. To make the approach viable, future work would need to:

1. Provide precise formal definitions of “orderly” and “chaotic” problems, possibly using algebraic structures or combinatorial properties.
2. Construct explicit polynomial‑time reductions from known P‑complete problems to orderly problems, and from known NP‑complete problems to chaotic problems, thereby establishing the claimed completeness results.
3. Offer rigorous time‑complexity analyses, including upper and lower bounds, with clear big‑O notation.
4. Demonstrate that chaotic problems satisfy the verification condition of NP (existence of short certificates).
5. Finally, develop a proof that the existence of these two families, with proven separations, implies P ≠ NP, or otherwise acknowledge that the result does not settle the question.

Without these elements, the paper remains an exploratory essay rather than a definitive contribution to the P versus NP discourse.