{"id":"https://openalex.org/W7138850994","doi":"https://doi.org/10.1109/globecom59602.2025.11431961","title":"Finding Periods of Continuous Functions on Turing Machines","display_name":"Finding Periods of Continuous Functions on Turing Machines","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7138850994","doi":"https://doi.org/10.1109/globecom59602.2025.11431961"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11431961","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11431961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129947386","display_name":"Holger Boche","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Holger Boche","raw_affiliation_strings":["Technical University of Munich,Chair of Theoretical Information Technology,M&#x00FC;nchen,Germany,80 333"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair of Theoretical Information Technology,M&#x00FC;nchen,Germany,80 333","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034863939","display_name":"Volker Pohl","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Volker Pohl","raw_affiliation_strings":["Technical University of Munich,Chair of Theoretical Information Technology,M&#x00FC;nchen,Germany,80 333"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair of Theoretical Information Technology,M&#x00FC;nchen,Germany,80 333","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129970702","display_name":"H. Vincent Poor","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Vincent Poor","raw_affiliation_strings":["Princeton University,Department of Electrical and Computer Engineering,Princeton,NJ,USA,08544"],"affiliations":[{"raw_affiliation_string":"Princeton University,Department of Electrical and Computer Engineering,Princeton,NJ,USA,08544","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5129947386"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79573867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2717","last_page":"2722"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.8996999859809875,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.8996999859809875,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.022199999541044235,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.014499999582767487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.808899998664856},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.720300018787384},{"id":"https://openalex.org/keywords/computable-number","display_name":"Computable number","score":0.7171000242233276},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.6620000004768372},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.6071000099182129},{"id":"https://openalex.org/keywords/period","display_name":"Period (music)","score":0.5605000257492065},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.555400013923645},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5354999899864197},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.4921000003814697}],"concepts":[{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.808899998664856},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.720300018787384},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.7171000242233276},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.6620000004768372},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.6071000099182129},{"id":"https://openalex.org/C2781291010","wikidata":"https://www.wikidata.org/wiki/Q178580","display_name":"Period (music)","level":2,"score":0.5605000257492065},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.555400013923645},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5354999899864197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5113000273704529},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.4921000003814697},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.48649999499320984},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4675000011920929},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.46299999952316284},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.45730000734329224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4447000026702881},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39320001006126404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3637000024318695},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.3571999967098236},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3093999922275543},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C192061203","wikidata":"https://www.wikidata.org/wiki/Q765620","display_name":"Quantum Turing machine","level":5,"score":0.3041999936103821},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.2948000133037567},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.2863999903202057},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.2671999931335449},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11431961","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11431961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1497475168","https://openalex.org/W1531869541","https://openalex.org/W1827134935","https://openalex.org/W1985449307","https://openalex.org/W1995875735","https://openalex.org/W2001188690","https://openalex.org/W2017112356","https://openalex.org/W2090828985","https://openalex.org/W2100989275","https://openalex.org/W2103265791","https://openalex.org/W2122068629","https://openalex.org/W2126160338","https://openalex.org/W2156186849","https://openalex.org/W2235384826","https://openalex.org/W2518032679","https://openalex.org/W2898104624","https://openalex.org/W3023478445","https://openalex.org/W4205115782","https://openalex.org/W4232277851","https://openalex.org/W4243563333"],"related_works":[],"abstract_inverted_index":{"Determining":[0],"the":[1,7,19,50,90,111],"period":[2,54,74,91,112],"of":[3,21,55,92],"a":[4,16,25,41,56,77,84,125],"function":[5],"is":[6,15,37,46,63,75,97,107],"main":[8],"step":[9],"in":[10,18],"Shor\u2019s":[11],"factorization":[12],"algorithm":[13,105],"which":[14],"cornerstone":[17],"theory":[20],"quantum":[22,30],"computing":[23,89],"and":[24],"primary":[26],"motivation":[27],"for":[28,66,88,113],"developing":[29],"computers.":[31],"This":[32],"paper":[33],"investigates":[34],"whether":[35],"it":[36,96],"possible":[38],"to":[39,48,109,121],"have":[40],"universal":[42,104],"Turing":[43,86],"machine":[44,87],"that":[45,65,100,106,118],"able":[47,108],"compute":[49,110],"minimum":[51],"(or":[52],"fundamental)":[53],"given":[57,126],"periodic":[58,68],"computable":[59,69,78],"continuous":[60,70],"function.":[61,94],"It":[62],"shown":[64,99],"every":[67],"function,":[71],"its":[72],"fundamental":[73],"always":[76,82],"number.":[79],"Therefore,":[80],"there":[81,101],"exists":[83,102],"specific":[85],"this":[93],"Nevertheless,":[95],"also":[98],"no":[103],"all":[114],"functions":[115],"having":[116],"periods":[117],"are":[119],"known":[120],"be":[122],"smaller":[123],"than":[124],"upper":[127],"bound.":[128]},"counts_by_year":[],"updated_date":"2026-03-20T20:54:20.808490","created_date":"2026-03-20T00:00:00"}
