Near-polynomial recursive sequences with algorithmically unsolvable problems

DOI10.3103/S0278641923030068MaRDI QIDQ6570668

S. S. Marchenkov

Publication date: 10 July 2024

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

zbMATH Keywords

near-polynomial recursive sequences

Mathematics Subject Classification ID

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

Cites Work

• Computations on counter machines with summator
• On the complexity of polynomial recurrence sequences
• On the complexity of the ℰ2 Grzegorczyk class
• On the complexity of recurring sequences
• Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)