On logarithmic-space computable real numbers

DOI10.1016/J.TCS.2012.10.004zbMATH Open1416.68077OpenAlexW2019323726MaRDI QIDQ1935807

Fuxiang Yu, Ker-I. Ko

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.004

zbMATH Keywords

complexitypolynomial timereal numberslogarithmic space

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of computability and recursion theory (03D80) Computation over the reals, computable analysis (03D78)

Related Items (4)

Regressive computations characterize logarithmic space ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• On the continued fraction representation of computable real numbers 👍 👎
• On approximate and algebraic computability over the real numbers 👍 👎
• Real number computability and domain theory 👍 👎
• On the Divergence Bounded Computable Real Numbers 👍 👎
• On the Representations of NC and Log-Space Real Numbers 👍 👎
• On 0′-computable reals 👍 👎
• Computability of Real Numbers 👍 👎
• Logical Approaches to Computational Barriers 👍 👎
• On the computational properties of the uncountability of the real numbers 👍 👎

This page was built for publication: On logarithmic-space computable real numbers

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