P not= NP for infinite time Turing machines
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.