Primitive recursive ordered fields and some applications

DOI10.3233/COM-210386OpenAlexW3094559359MaRDI QIDQ5880940

Victor L. Selivanov, Svetlana V. Selivanova

Publication date: 9 March 2023

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-210386

zbMATH Keywords

splittingspectral decompositionpolynomialprimitive recursionroot-findingreal closureordered fieldsymmetric hyperbolic system of PDE

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Related Items (2)

On the main scientific achievements of Victor Selivanov ⋮ COMPUTABLY COMPACT METRIC SPACES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Fields of algebraic numbers computable in polynomial time. I
• Primitive recursive ordered fields and some applications
• Nonconstructivizability of certain ordered fields of real numbers
• Polynomial-time versus recursive models
• Polynomial-time presentations of algebraic number fields
• On constructive number fields and computability of solutions of PDEs
• Degree spectra of real closed fields
• Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
• Primitive recursive fields and categoricity
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Computational complexity of real powering and improved solving linear differential equations
• An inequality for the discriminant of a polynomial
• Recursive analysis
• Is it harder to factor a polynomial or to find a root?
• Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
• Effective procedures in field theory
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• A note on computable real fields
• On the computational complexity of the Dirichlet Problem for Poisson's Equation
• Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Primitive recursive real numbers
• Computable Algebra, General Theory and Theory of Computable Fields
• Algorithms in real algebraic geometry

This page was built for publication: Primitive recursive ordered fields and some applications