求真分享 http://www.blog.sciencetimes.com.cn/u/zlyang 求真务实

博文

The kernel of "P vs NP Problem": Axiom of power set!

已有 7737 次阅读 2015-5-22 21:54 |系统分类:科研笔记| Turing, set, Axiom, Non-Deterministic

The kernel of "P vs NP Problem":

Axiom of power set!

       

     It can be found that a Non-Deterministic Turing Machine can generate a power set of its corresponding Deterministic Turing Machine in a linear time.

     If "Axiom of power set" is accepted, then P ≠ NP for a Deterministic Turing Machine.

Thank you for your guidance!

         

References:

[1] ZFC, Zermelo–Fraenkel set theory with the axiom of choice

http://www.blog.sciencetimes.com.cn/blog-107667-486692.html

[2] 2012-03-23,[请教] P对NP:请郝克刚教授等专家指教(一)

http://www.blog.sciencetimes.com.cn/blog-107667-550859.html

[3] 2011-08-21,俗解Chaitin定理

http://www.blog.sciencetimes.com.cn/blog-107667-478066.html 





http://www.blog.sciencetimes.com.cn/blog-107667-892400.html

上一篇:请毁灭我吧!全能的上帝!
下一篇:哀悼姜东身

4 王小平 张忆文 icgwang dulizhi95

该博文允许注册用户评论 请点击登录 评论 (20 个评论)

数据加载中...
扫一扫,分享此博文

Archiver|手机版|科学网 ( 京ICP备07017567号-12 )

GMT+8, 2021-10-25 00:43

Powered by ScienceNet.cn

Copyright © 2007- 中国科学报社

返回顶部