Pages that link to "Item:Q3657990"
From MaRDI portal
The following pages link to Computability and Noncomputability in Classical Analysis (Q3657990):
Displaying 22 items.
- Undecidability through Fourier series (Q278759) (← links)
- Recursive analysis of singular ordinary differential equations (Q638473) (← links)
- Classes of matrices for the traveling salesman problem (Q804474) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- Computing power series in polynomial time (Q1102956) (← links)
- From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
- Concrete models of computation for topological algebras (Q1292413) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. (Q1607286) (← links)
- Interpolation functor and computability. (Q1607301) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
- Integration in Real PCF (Q1854356) (← links)
- Undecidability in <b>R</b><sup><i>n</i></sup>: Riddled Basins, the KAM Tori, and the Stability of the Solar System (Q3093489) (← links)
- L<sup>p</sup>‐Computability (Q4704649) (← links)
- Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
