Struct KolmogorovBound 

pub struct KolmogorovBound {
    pub num_vars: usize,
    pub bits: usize,
    pub raw_bits: usize,
    pub tree: StructureTree,
}

A certified Kolmogorov upper bound on a Boolean function: the recursive structure decomposition and its total description size, with a re-checkable decode witness. This is a K̄ — an UPPER bound only. The kernel-certified Chaitin theorem in this module forbids certifying K(f) > c for any function past budget, so a bound that equals the raw 2ⁿ means “irreducible by this arsenal,” never “incompressible.”

Fields

num_vars: usize

bits: usize

K̄(f) — the total description size of the recursive decomposition (a computable upper bound).

raw_bits: usize

2ⁿ — the cost of storing the truth table outright.

tree: StructureTree

The recursive decomposition itself — the decode witness.

Implementations

impl KolmogorovBound

pub fn ratio(&self) -> f64

K̄(f) / 2ⁿ — → 0 for the algorithmically simplest functions, 1 for the residue.

pub fn is_compressed(&self) -> bool

Whether the decomposition beats storing the truth table.

pub fn verify(&self, truth: &[bool]) -> bool

Re-check the bound: the decomposition must decode back to the exact function.

Trait Implementations

impl Clone for KolmogorovBound

fn clone(&self) -> KolmogorovBound

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for KolmogorovBound

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.