On some computability notions for real functions (Q2851190)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On some computability notions for real functions |
scientific article; zbMATH DE number 6214535
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some computability notions for real functions |
scientific article; zbMATH DE number 6214535 |
Statements
10 October 2013
0 references
computability
0 references
real functions
0 references
operator
0 references
uniformity
0 references
subrecursive
0 references
On some computability notions for real functions (English)
0 references
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.
0 references
