𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Functions computable by a computer

✍ Scribed by A. Schurmann

Publisher
Springer Netherlands
Year
1971
Tongue
English
Weight
698 KB
Volume
27
Category
Article
ISSN
0039-3215

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of Boolean functions computed
The number of Boolean functions computed by formulas of a given size
✍ Petr SavickΓ½; Alan R. Woods πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 323 KB πŸ‘ 2 views

Estimates are given of the number B n, L of distinct functions computed by propositional formulas of size L in n variables, constructed using only literals and n, k Ε½ connectives. L is the number of occurrences of variables. L y 1 is the number of binary ns Ε½ . and ks. B n, L is also the number of f

Approximating functions by means of symb
Approximating functions by means of symbolic computation and a general extrapolation method
✍ J. Grotendorst πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 557 KB

Using a general extrapolation algorithm we present MAPLE procedures for the generation of polynomial and rational approximations to functions having formal series expansions. This algorithm, which has been called E algorithm or Brezinski-HΓ’vie (BH) protocol, includes most of the series (sequence) tr