Near-Polynomial Recursive Sequences with Algorithmically Unsolvable Problems
Crossref DOI link: https://doi.org/10.3103/S0278641923030068
Published Online: 2023-10-20
Published Print: 2023-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Marchenkov, S. S.
Text and Data Mining valid from 2023-09-01
Version of Record valid from 2023-09-01
Article History
Received: 9 January 2023
Revised: 5 March 2023
Accepted: 5 March 2023
First Online: 20 October 2023
CONFLICT OF INTEREST
: The author declares that he has no conflicts of interest.