Near-polynomial recursive sequences with algorithmically unsolvable problems

DOI10.3103/S0278641923030068MaRDI QIDQ6570668zbMATH OpenFDO

Authors S. S. Marchenkov

Publication date 10 July 2024

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0278641923030068

zbMATH Keywords

near-polynomial recursive sequences

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Connections of number theory and logic (11Uxx) Theory of computing (68Qxx)

Cites work

• Computations on counter machines with summator
• scientific article; zbMATH DE number 4085632 (Why is no real title available?)
• scientific article; zbMATH DE number 3272440 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• On the complexity of polynomial recurrence sequences
• On the complexity of recurring sequences
• On the complexity of the ℰ2 Grzegorczyk class
• Ultimate positivity is decidable for simple linear recurrence sequences

This page was built for publication: Near-polynomial recursive sequences with algorithmically unsolvable problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570668)