On some computability notions for real functions

DOI10.3233/COM-13018MaRDI QIDQ2851190zbMATH OpenOpenAlexFDO

Authors Dimiter Skordev

Publication date 10 October 2013

Published in Computability (Search for Journal in Brave)

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

zbMATH Keywords

computabilityoperatorreal functionssubrecursiveuniformity

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Review text

In this paper, the author studies the equivalence of certain approaches to the computability of real functions. Namely, the author considers one approach based on \textit{A. Grzegorczyck}'s work [Fundam. Math. 42, 168--202 (1955; Zbl 0066.26001)] and another approach based on the work of \textit{K. Tent} and \textit{M. Ziegler} [Münster J. Math. 3, No. 1, 43--66 (2010; Zbl 1234.03030)] and shows the equivalence between these two approaches.

Recommendations

• scientific article; zbMATH DE number 1191234
• On the Definition of Computable Function of a Real Variable
• A new approach to computability over the reals
• scientific article; zbMATH DE number 1222088
• scientific article; zbMATH DE number 7360045

Cited in

(19)

• A new approach to computability over the reals
• A Banach-Mazur computable but not Markov computable function on the computable real numbers
• Conditional computability of real functions with respect to a class of operators
• Towards computable analysis on the generalised real line
• Models of computation for partial functions on the reals
• On subrecursive complexity of integration
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• The realizability problem for Golovach-type functions
• scientific article; zbMATH DE number 1191234 (Why is no real title available?)
• Some Elementary Results About the Equivalence of Computability and Decidability
• scientific article; zbMATH DE number 1088270 (Why is no real title available?)
• Some characterizations of functions computable in on-line arithmetic
• scientific article; zbMATH DE number 1796999 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• scientific article; zbMATH DE number 7360045 (Why is no real title available?)
• Beyond Rogers’ Non-constructively Computable Function
• \(\text{P}\neq \text{NP}\) for the reals with various analytic functions
• Relatively computable functions of real variables
• scientific article; zbMATH DE number 7809184 (Why is no real title available?)

This page was built for publication: On some computability notions for real functions

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