Reachable-Code Loss in Fixed-Scale Full-Turn Quantization: Tau's Advantage over Pi
This paper compares direct quantization of "τ = 2π" with doubling a quantized "π" in fixed-scale arithmetic, showing an exact reachable-code restriction and how a factor-of-two source-grid refinement removes it.
Authors
- Meryem Katircioglu
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-10-06
- DOI
- https://doi.org/10.5281/zenodo.23184234
- Primary Topic
- Numerical Methods and Algorithms
- Type
- preprint