General Science and Philosophy

    

Symmetry as Turing Machine - Approach to solve P vs NP

Authors: Koji KOBAYASHI

This article describes about that P is not NP by using difference of symmetry. Turing Machine (TM) change configuration by using transition functions. This changing keep halting configuration. That is, TM classify these configuration into equivalence class. The view of equivalence class, there are different between P and coNP. Some coNP problem have over polynomial size totally order inputs. These problem cannot reduce P because these totally order must keep. Therefore we cannot reduce some coNP problem to P problem. This means P is not NP.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2014-01-26 09:01:02

Unique-IP document downloads: 203 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus