pyphi.macro.search.ComplexesResult#

class pyphi.macro.search.ComplexesResult(complexes, records, ties)[source]#

The complexes of the bounded candidate space (Eq. 20, applied recursively).

Variables:

complexes (tuple[Complex, ...]) – The complexes identified by the recursive exclusion cascade over the candidates in P(u) with φₛ > 0, in descending-φₛ order, each carrying its macro unit structure and exclusion records. Mutually disjoint in micro footprint by construction; empty when every candidate is reducible.
records (tuple[EvaluationRecord, ...]) – One entry per candidate the run considered (criteria checks included): evaluated systems first, in evaluation order, with exact φₛ (and their intrinsic-information ceiling when the certified prune computed one), followed by gated candidates carrying phi=None and their ceiling. A candidate is gated only when its φₛ is certifiably below an overlapping accepted complex’s at precision.
ties (tuple[tuple[MacroSystem, ...], ...]) – Cliques of overlapping candidate systems that tied at φₛ and still tied at Φ under Composition escalation, failing the exclusion postulate; none of their members is a complex.

Parameters:

property maximal_complex#: The φₛ-maximal complex, or a falsy null Complex when none exists.