DeepAI AI Chat
Log In Sign Up

Primitive Recursive Ordered Fields and Some Applications

by   Victor Selivanov, et al.

We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In particular, we find a partial primitive recursive analogue of Ershov-Madison's theorem about real closures of computable ordered fields, relate the corresponding fields to the primitive recursive reals, give sufficient conditions for primitive recursive root-finding, computing normal forms of matrices, and computing solution operators of some linear systems of PDE.


page 1

page 2

page 3

page 4


On the computability of ordered fields

In this paper we develop general techniques for classes of computable re...

Formalizing computability theory via partial recursive functions

We present a formalization of the foundations of computability theory in...

An Additive Decomposition in S-Primitive Towers

We consider the additive decomposition problem in primitive towers and p...

Classical (Co)Recursion: Mechanics

Primitive recursion is a mature, well-understood topic in the theory and...

On Rudimentarity, Primitive Recursivity and Representability

It is quite well-known from Kurt Gödel's (1931) ground-breaking result o...

An algebraic theory for data linkage

There are countless sources of data available to governments, companies,...

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...