GitHub Pages site: https://pstdenis.github.io/Boolean-Tile/
The 16 Boolean functions of two variables — the "Boolean tiles" — form a complete algebraic, geometric, and physical system. This project traces them from truth tables through Łukasiewicz logic, iterated function system (IFS) fractals, Bloch-sphere quantum states, 2-qubit unitary gates, and Ising spin Hamiltonians.
docs/— GitHub Pages site with the full paper and interactive visualizationsdocs/Boolean Tile Basis.html— The working paperdocs/Polar IFS.html— 2D polar IFS attractor visualization (greyscale annular rings)docs/Bloch.html— 3D Bloch-sphere spherical visualization of the 16 tilesdocs/— Additional interactive HTML demos
Each 2×2 truth table (tile) defines a carry-free bitwise logic that, when iterated to infinite depth, produces a self-similar fractal attractor. Under
- Boolean — 16 truth tables
- Continuous — Łukasiewicz (MV-algebra) extension
- Complex — Phase-preserving near-MV-algebra on the disk
- Fractal — IFS attractor (chaos game)
-
Quantum —
$H^{\otimes2}$ -conjugated unitary gates - Temporal — Depth iteration as discrete time
- Many-worlds — Branching measure interpretation
-
Multi-qubit —
$n$ -register depth process - Physical — Ising spin Hamiltonians
The IFS/liear chaos-game approach to logical systems originates with Grim, Mar, and St. Denis (The Philosophical Computer, MIT Press 1998). This project extends their framework to the Bloch sphere, to quantum gate synthesis, and to physical Hamiltonian realizations.
All materials are provided for research and educational purposes.