Skip to content
DraconiticResearch
Search Sources API
181,713 studies31 sourcesUpdated 16 min ago
PreprintarXiv licencearXiv

Tag-system computation using only powers and principal logarithms

  • Trevor Cappallo
Open at sourcePDFDOICite

Abstract

I show that one exact step of any tag system can be written as a single fixed expression using only powers and logarithms. A tag state is represented as an integer; evaluating the expression yields the integer encoding of the next configuration, and feeding the answer back into the same expression follows the computation step by step. The discrete part of the update comes from leveraging the wraparound in the principal complex logarithm, which effectively serves the same purpose as floor, mod, or sin in comparable approaches. The iterating expressions use only xy and logb a: it turns out that these two binary operations are sufficient, with no need for constants. It follows that reachability below a fixed threshold is undecidable for one fixed expression. As a separate application, the same mechanism represents addition, 2x, and remainder with the convention xbmod0=x, and hence every Kalmár elementary function.

Related

  1. Functional Calculus on Noncommutative Tori, II. Complex Powers, Logarithms, and Sectorial Projections
    Gihyun Lee, Raphael Ponge
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. Sharp decay characterization for the Oldroyd-B system with only velocity dissipation
    Zhi Chen, Mingwen Fei, Lvqiao Liu +1
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Exact Realization of Deep ReLU Computation in a Microscopic Statistical-Mechanical System
    Junxu Li
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  4. Certified computation of Buehler confidence limits for system reliability
    Zhaohui Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. GradAgent: A Knowledge-Guided Multi-Agent System for Structure-Preserving Gradient-Flow Computation with an Application to Multicomponent Vesicle Dynamics
    Zhenlin Guo, Jiale Meng, Shuqi Tang +4
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv

Cite

BibTeXRIS
BibTeX
@misc{cappallo2026tagsystem,
  title = {{Tag-system computation using only powers and principal logarithms}},
  author = {Trevor Cappallo},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.10592},
  eprint = {2609.10592},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.10592},
}
RIS
TY  - UNPB
TI  - Tag-system computation using only powers and principal logarithms
AU  - Trevor Cappallo
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.10592
UR  - https://arxiv.org/abs/2609.10592
AB  - I show that one exact step of any tag system can be written as a single fixed expression using only powers and logarithms. A tag state is represented as an integer; evaluating the expression yields the integer encoding of the next configuration, and feeding the answer back into the same expression follows the computation step by step. The discrete part of the update comes from leveraging the wraparound in the principal complex logarithm, which effectively serves the same purpose as floor, mod, or sin in comparable approaches. The iterating expressions use only x^y and log_b a: it turns out that these two binary operations are sufficient, with no need for constants. It follows that reachability below a fixed threshold is undecidable for one fixed expression. As a separate application, the same mechanism represents addition, 2^x, and remainder with the convention xbmod0=x, and hence every Kalmár elementary function.
ER  -