Equivalence of Halting Problem to Convergence of Power Series

2025/09/18 by Fernandes, Antonio Joaquim
Computer Science · #94-02 #FOS: Computer and information sciences #Information Theory (cs.IT) #Logic in Computer Science (cs.LO) #Matrix Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.2509.16270

openalex publication_date 2025/09/18 · openalex created_date 2025/10/16 · openalex updated_date 2026/07/28

Abstract

This paper establishes an equivalence between the halting problem in computability theory and the convergence of power series in mathematical analysis.

Related

• The Halting Paradox
• How to Compute Halting
• Observations on the Halting Problem
• Did Turing prove the undecidability of the halting problem?
• Power Series in Several Complex Variables