Front Cover; Advances in Computers, Volume 14; Copyright Page; Contents; Contributors; Preface; Chapter 1. On the Structure of Feasible Computations; 1. Introduction; 2. Feasible Computations and Nondeterminism; 3. Memory-Bounded Computations; 4. Nondeterministic Tape Computations and the Iba Problem; 5. Random Access Machines; 6. Conclusion; References; Chapter 2. A Look at Programming and Programming Systems; 1. Introduction; 2. Some Background; 3. Classes of Programs; 4. Facilities for Small-Scale Programs; 5. The EL1 Language and ECL System; 6. Aids for the Nonexpert Programmer.

6. Bundle Processing and Ergodic Processing7. Examples of Bundle and Ergodic Machines; 8. An Overview of Burst Processing; 9. Preliminary Results in Burst Processing; 10. Outlook in Statistical Processing; References; Chapter 5. Information Secure Systems; 1. Prologue; 2. Introduction; 3. Toward an Understanding of Logical Access Control Mechanisms; 4. Some Thoughts on Information-Theoretic Protection; 5. Can We Build Information Secure Systems?; 6. Summary and Prospectus; References; Author Index; Subject Index; Contents of Previous Volumes.

7. Aids for the Production of Complex ProgramsReferences; Chapter 3. Parsing of General Context-Free Languages; Introduction; 1. Preliminaries; 2. The Cocke-Karami-Younger Algorithm; 3. Earley's Algorithm; 4. Valiant's Algorithm; 5. The Hardest Context-Free Language; 6. Bounds on Time and Space; References; Chapter 4. Statistical Processors; 1. Pros and Cons of Statistical Information Representation.; 2. An Overview of Time Stochastic Processing; 3. Fluctuations and Precision of Stochastic Sequences; 4. Generation of Random and Quasi-Random Sequences; 5. Examples of Time Stochastic Machines.