PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 10, 20260 citationsOpen Access

Technical Report: Autonomous Traversal Synchrony Algorithm (STA) — Information Efficiency and Phase Closure

View Full Paper
RRRicardo Hernández Reveles

Key Points

  • To verify the convergence rates of continued fractions related to the non-trivial zeros of the Riemann zeta function using the STA algorithm.
  • Computational verification of continued fraction convergence rates for Riemann zeta function zeros
  • Analysis of the effective rate of convergence
  • Comparison with Lévy constant prediction
  • Effective convergence rate found to be 3.33±0.54 bits per continued fraction term
  • Results consistent with Lévy constant prediction of 3.42 bits/term
  • Includes established computability bounds

Abstract

Computational verification of continued fraction convergence rates for the first 8 non-trivial zeros of the Riemann zeta function via the STA algorithm. Effective rate: 3.33±0.54 bits/CF term, consistent with the Lévy constant prediction of 3.42 bits/term. Includes computability bound.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ricardo Hernández Reveles (2026) studied this question.

synapsesocial.com/papers/69af957570916d39fea4d0e6https://doi.org/10.5281/zenodo.18916006
Ask AI
Helpful
Bookmark
Share
View Full Paper