Speedable Left-c.e. Numbers

DOI10.1007/978-3-030-50026-9_22MaRDI QIDQ5042251zbMATH OpenOpenAlexFDO

Authors Wolfgang Merkle, Ivan Titov

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50026-9_22

zbMATH Keywords

left-c.e. real numbersMartin-Löf-randomnessSolovay reducibilityspeedable

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 3932301
• Faster arithmetic for number-theoretic transforms
• Fast Arithmetical Algorithms in Möbius Number Systems
• Acceleration of the computation of Bernoulli numbers
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Faster computation of Bernoulli numbers
• Towards faster real algebraic numbers
• scientific article; zbMATH DE number 2151239
• Fast Multipliers for Number Theoretic Transforms
• On Faster Integer Calculations Using Non-arithmetic Primitives

Cites work

• Algorithmic randomness and complexity.
• Computability and Randomness
• Computational complexity, speedable and levelable sets
• Differences of halting probabilities

Cited in

(5)

• Regainingly approximable numbers and sets
• Computable operators on left-c.e. reals and their continuity properties
• Randomness versus superspeedability
• Speedability of computably approximable reals and their approximations
• Relative randomness and continuous translation functions

This page was built for publication: Speedable Left-c.e. Numbers

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