中文

P not= NP for infinite time Turing machines

逻辑 2007-05-23 v1

摘要

We state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.

引用

@article{arxiv.math/0106087,
  title  = {P not= NP for infinite time Turing machines},
  author = {Ralf Schindler},
  journal= {arXiv preprint arXiv:math/0106087},
  year   = {2007}
}

备注

2 pages