Struct HierarchicalPhiEngine 

pub struct HierarchicalPhiEngine {
    pub exact_threshold: usize,
}

Hierarchical Φ approximation for large systems.

Recursively bisects the system into subsystems, computes Φ for each, then estimates global Φ as the minimum sub-system Φ. This is a conservative lower bound (global Φ ≤ min(sub-Φ)).

Works for arbitrarily large systems by recursively halving until subsystems are small enough for exact computation.

Complexity: O(n² log n) — log(n) levels × n² per level.

Fields

exact_threshold: usize

Maximum subsystem size for exact computation.

Implementations

impl HierarchicalPhiEngine

pub fn new(exact_threshold: usize) -> Self

Trait Implementations

impl Default for HierarchicalPhiEngine

fn default() -> Self

Returns the “default value” for a type.

impl PhiEngine for HierarchicalPhiEngine

fn compute_phi( &self, tpm: &TransitionMatrix, state: Option<usize>, budget: &ComputeBudget, ) -> Result<PhiResult, ConsciousnessError>

Compute Φ for the given transition probability matrix.

fn algorithm(&self) -> PhiAlgorithm

Return the algorithm identifier.

fn estimate_cost(&self, n: usize) -> u64

Estimate computational cost without performing the computation.