Pages that link to "Item:Q5898855"
From MaRDI portal
The following pages link to Logical Approaches to Computational Barriers (Q5898855):
Displaying 21 items.
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- A note of best fractions of a computable real number (Q1201155) (← links)
- Real numbers and computers (Q1279561) (← links)
- A new approach to computability over the reals (Q1284389) (← links)
- Handbook of computability theory (Q1307021) (← links)
- Real number computations: On the use of information (Q1346475) (← links)
- Recursion theory on the reals and continuous-time computation (Q1349921) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Real number computability and domain theory (Q1923085) (← links)
- On logarithmic-space computable real numbers (Q1935807) (← links)
- Spectrum of the field of computable real numbers (Q2401539) (← links)
- Weak computability and representation of reals (Q3159428) (← links)
- A Complete Axiomatization of Computer Arithmetic (Q3694696) (← links)
- (Q4263799) (← links)
- The approximation structure of a computably approximable real (Q4650263) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
- (Q4812938) (← links)
- Primitive Recursiveness of Real Numbers under Different Representations (Q4921448) (← links)
- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals (Q4928437) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431356) (← links)
- Weakly computable real numbers (Q5925970) (← links)
