About this document

Reordered Computable Numbers Explained by jitendra singh is a document available to read on EtoBox.

This article investigates a subset of left-computable numbers called reordered computable numbers, defined by computable functions and rearranged series that converge computably. It demonstrates that these numbers are closed under addition, multiplication, and Solovay reduction, and presents examples, counterexamples, and a density theorem related to them. The paper also discusses the relationship between reordered computable numbers and other classes of computable numbers, highlighting their significance i

Author

jitendra singh

Language

EN