Self-Organizing Systems, 1963

by Unknown

[9] Random cartesian product.

[10] Kleyn, P. A., “Conceptual Design of Self-Organizing Machines,” Anaheim, California:Northrop Nortronics, NSS Report 2832, Nov. 14, 1963.

[11] Harman, W. W., “Principles of the Statistical Theory of Communication,” New York, New York:McGraw-Hill, 1963.

[12] Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.

[13] Munroe, M. E., “Introduction to Measure and Integration,” Cambridge, Mass.:Addison-Wesley, 1953.

[14] Halmos, P. R., “Measure Theory,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1950.

[15] Kelley, J. L., “General Topology,” Princeton, New Jersey:D. Van Nostrand Co., Inc., 1955.

[16] Feinstein uses his axioms only in finite space X; i.e., card(X) < K₀.

[17] Feinstein, A., “Foundations of Information Theory,” New York, New York: McGraw-Hill, 1958.

[18] If I is infinite, certain precautions have to be exercised.