## 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
β¦ 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
Primitive program algebras of computable
β
D. B. Bui; I. V. Red'ko
π
Article
π
1988
π
Springer US
π
English
β 909 KB
A sequence of complexly computable funct
β
L. A. Sholomov
π
Article
π
1975
π
SP MAIK Nauka/Interperiodica
π
English
β 414 KB
Relatively Computable Functions of Real
β
Qing Zhou
π
Article
π
2001
π
Springer Vienna
π
English
β 148 KB
Functions computable by a computer
β
A. Schurmann
π
Article
π
1971
π
Springer Netherlands
π
English
β 698 KB
Computable functions in tabular database
β
B. V. Gubskii; I. A. Basarab
π
Article
π
1989
π
Springer US
π
English
β 778 KB