3 papers
cs.LO2026
Substantive Agency and Computational Non-Anticipability: An Axiomatic Route to a Conditional Separation of P and N P
Jérome Clech
This paper characterises substantive agency and identifies the additional bridges under which it has a standard complexity-theoretic consequence: conditionally, P __ = N P . The co…
cs.LO2026
Ontological free will as incompressible information adjunction: A noncomputability boundary beyond P versus NP
J{é}rome Clech
We study a conditional model of ontological free will in which a pre-act state structures several coherent global continuations without intrinsically distinguishing one as the futu…
cs.LO2026
Computational free will as global selection: from sheaf-theoretic gluing to a conditional separation of P and NP
Jerome Clech
We formalise computational free will by separating locally constrained admissibility from the selection of one global continuation. Global sections of a finite choice presheaf form…