pyphi.macro.search.complexes#

pyphi.macro.search.complexes(substrate, micro_history, bounds=SearchBounds(max_constituents=4, max_update_grain=1, max_depth=1, mappings='FAMILIES', exhaustive_cap=8, apportionment='NONE', max_background=0), parallel_kwargs=None, prune=None)[source]#

Identify the complexes of the bounded candidate space – the one-call driver.

Every admissible system of intrinsic units (Eq. 19) is evaluated over the full universe, then condensed by the recursive exclusion cascade: Eq. 20’s comparison is applied tier by tier, so a candidate excluded by an accepted complex has no standing to exclude other candidates. φₛ ties between overlapping candidates escalate to Composition (Φ); cliques that still tie fail exclusion and are reported in ties.

prune="certified" skips partition sweeps whose outcome is certified by the intrinsic-information requirement; "off" evaluates everything; None (default) selects "certified" exactly when the active system measure applies the requirement.

Notes

Under the certified prune the identified complexes, ties, and verdicts are identical to a full evaluation; only records distinguishes gated candidates from evaluated ones.

Parameters:
Return type:

ComplexesResult