P not= NP for infinite time Turing machines
Preprint
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.Keywords
All Related Versions
This publication has 1 reference indexed in Scilit:
- Infinite time Turing machinesThe Journal of Symbolic Logic, 2000