Sign inSign in

PSPACE complexity class with closed timelike curves (PCTCP_{\mathrm{CTC}})

The class of problems solvable in polynomial time using a classical computer inside of a closed timelike curve, which equals PSPACE.
as Scott Aaronson defines itGraduate Mathematics
Watch it explained

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

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.