๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal-program complexity of sequences with restricted resources

โœ Scribed by R.P. Daley

Book ID
114036951
Publisher
Elsevier Science
Year
1973
Weight
554 KB
Volume
23
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The extent and density of sequences with
The extent and density of sequences within the minimal-program complexity hierarchies
โœ R.P. Daley ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 622 KB

In this paper we examine the minimal-program complexity (i.e., the length of a shortest program for computing the initial segments) of recursively enumerable and A S sequences. We determine bounds on the upper and lower extent of these sequences within the complexity hierarchy. Many of these bounds