We show that the computational power of the non-causal circuit model, i.e. the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity class UP∩coUP. An example of a problem in that class is factorization. Our result implies that classical deterministic closed timelike curves (CTCs) cannot efficiently solve problems that lie outside of that class. Thus, in stark contrast to other CTC models, these CTCs cannot efficiently solve NP-complete problems, unless NP=UP∩coUP=coNP, which lets their existence in nature appear less implausible. This result gives a new characterization of UP∩coUP in terms of fixed points.
Keywords: causality; closed timelike curves; complexity theory; non-causal computation; unambiguous polynomial time.