P not= NP for infinite time Turing machines
classification
🧮 math.LO
keywords
infinitemachinestimeturingversionobservedproblemstate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.