Information Processing

This book contains an extensive number of fully solved problems in Boolean Algebra, Classical Logic, Cellular Automata, and formal probability manipulations to augment the already existing exercises of Volume I.Thus, the problems solved here are somewhat harder or more involved than those appearing in Volume I. I also indulge in the luxury of taking as much space as I desire to fully explicate some core concepts that could only be touched upon lightly in Volume I.For example, I devote a full eight pages and four separate exercises to explain the combinatorial counting formulas through Feller's classic problem of computing the probability of the number of accidents during a week.In addition, I spend some time on examining the analogy between de Finetti's representation theorem and the formal probability manipulation rule that expresses the probability for a statement as a weighted average over all models that make numerical assignments to these statements.As a final typical example, I present many solved exercises that look at the development of the hypergeometric probability distribution from the different perspective proffered by Jaynes and Jeffreys. (Published posthumously. Minor typographical and content errors may remain.)