The Complexity of the Successor and the Block Relations on Computable Linear Orders
Crossref DOI link: https://doi.org/10.1134/S199508022561063X
Published Online: 2026-01-09
Published Print: 2025-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Frolov, A. N.
Zubkov, M. V.
Text and Data Mining valid from 2025-08-01
Version of Record valid from 2025-08-01
Article History
Received: 2 June 2025
Revised: 30 June 2025
Accepted: 10 July 2025
First Online: 9 January 2026
CONFLICT OF INTEREST
: The authors of this work declare that they have no conflicts of interest.