Finitely bounded effective computability

DOI10.1016/J.ENTCS.2008.03.019MaRDI QIDQ4918041zbMATH OpenOpenAlexFDO

Authors Xizhong Zheng

Publication date 3 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.03.019

zbMATH Keywords

bounded computabilitycomputable real numbersd-c.e. real numbershierarchy

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Recommendations

• Divergence bounded computable real numbers
• Some initial thoughts on bounded query computations over the reals
• On the divergence bounded computable real numbers
• A hierarchy of Turing degrees of divergence bounded computable real numbers
• scientific article; zbMATH DE number 2089959

Cites work

• A hierarchy of Turing degrees of divergence bounded computable real numbers
• Classification of the computable approximations by divergence boundings
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• Limiting recursion
• On the Turing Degrees of Weakly Computable Real Numbers
• Trial and error predicates and the solution to a problem of Mostowski
• Weak computability and representation of reals
• Weakly computable real numbers

Cited in

(4)

• Effective Choice and Boundedness Principles in Computable Analysis
• Relative randomness and real closed fields
• scientific article; zbMATH DE number 817189 (Why is no real title available?)
• A hierarchy of Turing degrees of divergence bounded computable real numbers

This page was built for publication: Finitely bounded effective computability

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