✦ LIBER ✦

A sequence of complexly computable functions

✍ Scribed by L. A. Sholomov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1975
Tongue: English
Weight: 414 KB
Volume: 17
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01442706

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Functions computable by a computer

✍ A. Schurmann 📂 Article 📅 1971 🏛 Springer Netherlands 🌐 English ⚖ 698 KB

Derivatives of Computable Functions

✍ Ning Zhong 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 665 KB

## 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 th

Computable functions in tabular database

Computable functions in tabular databases

✍ B. V. Gubskii; I. A. Basarab 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 778 KB

Primitive program algebras of computable

Primitive program algebras of computable functions

✍ D. B. Bui; I. V. Red'ko 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 909 KB

Relatively Computable Functions of Real

Relatively Computable Functions of Real Variables

✍ Qing Zhou 📂 Article 📅 2001 🏛 Springer Vienna 🌐 English ⚖ 148 KB

Iterative Characterizations of Computabl

Iterative Characterizations of Computable Unary Functions: A General Method

✍ Stefano Mazzanti 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

## Abstract Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving