A recursion theoretic foundation of computation over real numbers

DOI10.1093/LOGCOM/EXAB042MaRDI QIDQ5163985zbMATH OpenOpenAlexFDO

Authors Keng Meng Ng, N. R. Tavana, Yue Yang

Publication date 9 November 2021

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.00791

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• Recursive analysis characterized as a class of real recursive functions
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Recursive characterization of computable real-valued functions and relations
• scientific article; zbMATH DE number 1222088
• On the Definition of Computable Function of a Real Variable

Cited in

(10)

• Computing over the reals with addition and order
• Recursion theory on the reals and continuous-time computation
• Analog computers and recursive functions over the reals.
• A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
• scientific article; zbMATH DE number 1354146 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Primitive recursive real numbers
• Logical Approaches to Computational Barriers
• A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
• Simulation of Turing machines with analytic discrete ODEs: polynomial-time and space over the reals characterised with discrete ordinary differential equations

This page was built for publication: A recursion theoretic foundation of computation over real numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5163985)