𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Derivatives of Computable Functions

✍ Scribed by Ning Zhong


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
665 KB
Volume
44
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

As is well known the derivative of a computable and C^1^ function may not be computable. For a computable and C∞ function f, the sequence {f^(n)^} of its derivatives may fail to be computable as a sequence, even though its derivative of any order is computable. In this paper we present a necessary and sufficient condition for the sequence {f^(n)^} of derivatives of a computable and C^∞^ function f to be computable. We also give a sharp regularity condition on an initial computable function f which insures the computability of its derivative fβ€².


πŸ“œ SIMILAR VOLUMES


Computable choice functions for computab
✍ Manuel Lerman; Richard Watnick πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 351 KB

## Abstract A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order‐types for which each computable model has a computable choice set, and a full characterization i

Functions computable by a computer
✍ A. Schurmann πŸ“‚ Article πŸ“… 1971 πŸ› Springer Netherlands 🌐 English βš– 698 KB