P not= NP for infinite time Turing machines
Logic
2007-05-23 v1
Abstract
We state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.
Cite
@article{arxiv.math/0106087,
title = {P not= NP for infinite time Turing machines},
author = {Ralf Schindler},
journal= {arXiv preprint arXiv:math/0106087},
year = {2007}
}
Comments
2 pages