ConceptTheory & Algos
PSPACE complexity class with closed timelike curves ()
The class of problems solvable in polynomial time using a classical computer inside of a closed timelike curve, which equals PSPACE.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.