@inproceedings{6133da16084842b0aa2517174b5a9540,
title = "Finding Periods of Continuous Functions on Turing Machines",
abstract = "Determining the period of a function is the main step in Shor's factorization algorithm which is a cornerstone in the theory of quantum computing and a primary motivation for developing quantum computers. This paper investigates whether it is possible to have a universal Turing machine that is able to compute the minimum (or fundamental) period of a given periodic computable continuous function. It is shown that for every periodic computable continuous function, its fundamental period is always a computable number. Therefore, there always exists a specific Turing machine for computing the period of this function. Nevertheless, it is also shown that there exists no universal algorithm that is able to compute the period for all functions having periods that are known to be smaller than a given upper bound.",
author = "Holger Boche and Volker Pohl and Poor, \{H. Vincent\}",
note = "Publisher Copyright: {\textcopyright} 2025 IEEE.; 2025 IEEE Global Communications Conference, GLOBECOM 2025 ; Conference date: 08-12-2025 Through 12-12-2025",
year = "2025",
doi = "10.1109/GLOBECOM59602.2025.11431961",
language = "English (US)",
series = "Proceedings - IEEE Global Communications Conference, GLOBECOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2717--2722",
booktitle = "GLOBECOM 2025 - 2025 IEEE Global Communications Conference",
address = "United States",
}