On logarithmic-space computable real numbers

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

Authors: 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

Recommendations

• Logical Approaches to Computational Barriers
• On \(0'\)-computable reals
• On the divergence bounded computable real numbers
• On the Representations of NC and Log-Space Real Numbers
• On approximate and algebraic computability over the real numbers
• scientific article; zbMATH DE number 1333613
• Real number computability and domain theory
• Computability of Real Numbers
• On the computational properties of the uncountability of the real numbers
• On the continued fraction representation of computable real numbers

zbMATH Keywords

complexitylogarithmic spacepolynomial timereal numbers

Mathematics Subject Classification ID

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

Cited In (5)

• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
• Title not available (Why is that?)
• Regressive computations characterize logarithmic space
• In Memoriam: Ker-I Ko (1950–2018)
• On the Representations of NC and Log-Space 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)