✦ LIBER ✦

Minimal-program complexity of pseudo-recursive and pseudo-random sequences

✍ Scribed by R. P. Daley

Publisher: Springer
Year: 1975
Tongue: English
Weight: 937 KB
Volume: 9
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01698128

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pseudo-randomness and complexity of bina

Pseudo-randomness and complexity of binary sequences generated by the chaotic system

✍ Liu Nian-sheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 481 KB

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

Erratum to “The use of a pseudo-random s

Erratum to “The use of a pseudo-random spin flipper sequence on a polarised neutron scattering instrument” [Nucl. Instr. and Meth. A 314 (1992) 155–162]

✍ L.D. Cussen; J.C. Osborn; P. Gibbs; T.J. Hicks 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 39 KB