Neurophysiology

Contains reports on four research projects.National Science Foundation (Grant G-16526)National Institutes of Health (Grants MH-04737-03 and NB-04985-01)United States Air Force, Aeronautical Systems Division (Contract AF33(616)-7783)United States Air Force (Contract AF19(604)-6619), administered by Montana State CollegeNational Aeronautics and Space Administration (Grant NsG-496)Teagle Foundation, IncorporatedBell Telephone Laboratories, Incorporate

Inverted theory networks

Includes bibliographical references (leaves 147-152).The logicatom is defined, and it is argued that this represents the quantum of knowledge. Theory networks encapsulating a set of logicatoms and the dynamic relations between them, are defined. It is shown that these structures call emulate cellular automaton systems and in particular, simulate universal Turing machines. The regulating priuciple of natural selection is formalised together with its necessary and sufficient conditions. It is proven that there exists inverted theory networks (an analogous construct to theory networks) that satisfy all the requirements specified for natural selection to regulate their dynamics. The applicability of inverted theory networks to modelling thought is analysed. Further, inverted theory networks are proposed as a candidate for the pregeometry hypothesised by Wheeler

Pseudorandom number generator by cellular automata and its application to cryptography.

by Siu Chi Sang Obadiah.Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.Includes bibliographical references (leaves 66-68).Abstracts in English and Chinese.Chapter 1 --- Pseudorandom Number Generator --- p.5Chapter 1.1 --- Introduction --- p.5Chapter 1.2 --- Statistical Indistingushible and Entropy --- p.7Chapter 1.3 --- Example of PNG --- p.9Chapter 2 --- Basic Knowledge of Cellular Automata --- p.12Chapter 2.1 --- Introduction --- p.12Chapter 2.2 --- Elementary and Totalistic Cellular Automata --- p.14Chapter 2.3 --- Four classes of Cellular Automata --- p.17Chapter 2.4 --- Entropy --- p.20Chapter 3 --- Theoretical analysis of the CA PNG --- p.26Chapter 3.1 --- The Generator --- p.26Chapter 3.2 --- Global Properties --- p.27Chapter 3.3 --- Stability Properties --- p.31Chapter 3.4 --- Particular Initial States --- p.33Chapter 3.5 --- Functional Properties --- p.38Chapter 3.6 --- Computational Theoretical Properties --- p.42Chapter 3.7 --- Finite Size Behaviour --- p.44Chapter 3.8 --- Statistical Properties --- p.51Chapter 3.8.1 --- statistical test used --- p.54Chapter 4 --- Practical Implementation of the CA PNG --- p.56Chapter 4.1 --- The implementation of the CA PNG --- p.56Chapter 4.2 --- Applied to the set of integers --- p.58Chapter 5 --- Application to Cryptography --- p.61Chapter 5.1 --- Stream Cipher --- p.61Chapter 5.2 --- One Time Pad --- p.62Chapter 5.3 --- Probabilistic Encryption --- p.63Chapter 5.4 --- Probabilistic Encryption with RSA --- p.64Chapter 5.5 --- Prove yourself --- p.65Bibliograph

Cellular automata methods in mathematical physics

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 1994.Includes bibliographical references (p. 233-243).by Mark Andrew Smith.Ph.D

Contributions to Combinatorial Semigroup Theory

Abstract not provided