hsfzLZH1's Homepage
2026
- Eventual uniqueness of large models, without a prescribed threshold
- The ordering of computational difficulty has no hidden symmetries
- Encoding every accepting computation by exactly one Diophantine witness
- Counting without choices cannot express every polynomial-time query
- Comparing a partition’s size does not recover the Axiom of Choice
- If every legal expression can normalize, every reduction strategy terminates