A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
From MaRDI portal
Publication:2546500
DOI10.1307/mmj/1029000631zbMath0218.02029OpenAlexW2079942928MaRDI QIDQ2546500
Publication date: 1971
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1029000631
Related Items
A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK ⋮ Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma ⋮ Computability and Noncomputability in Classical Analysis ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ On estimating derivatives of input signals in biochemistry ⋮ The wave equation with computable initial data such that its unique solution is not computable ⋮ Recursive analysis of singular ordinary differential equations ⋮ When series of computable functions with varying domains are computable ⋮ Bibliography of John Myhill ⋮ Eight problems about Nerode semirings (recursive ultrapowers) ⋮ Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ The case for hypercomputation ⋮ Computable structures and operations on the space of continuous functions ⋮ Unnamed Item ⋮ Computable invariance ⋮ Relatively recursive reals and real functions ⋮ Computability structure of the Sobolev spaces and its applications ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ Differential equations in constructive analysis and in the recursive realizability topos ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Computable Complex Analysis
