Volume 25 of W. Ross Ashby's Journal
is loading...

Warning: Your browser does not have JavaScript enabledJavaScript has been used to implement many features on this Web site. Unless you enable JavaScript, the following things will not work for you: pop-up image previews, feedback links, random page links, the jump-to-any-page, jump-to-any-volume boxes, and much more. It will annoy you...

1968



Volume 25



6975+03	6975+04



6975+05	6975+06

Independence effect on Q Interaction and independence

6976	6977

Summary: Interaction between two subsets of variables.
Summary: If two variables do not communicate, either directly or indirectly, then any interaction Q that include them must go to zero. Steady state Morowitz' book Thermodynamics Morowitz' book
6978	6979



6980	6981

1969

Summary: Morowitz' magnificent book. 7053 Entropy expected value
Constraint permutation as Permutation constraint necessary Transmission for permutation
6982	6983


Summary: The informational qualities involved when the coordination achieves a permutation. 6993, 7006
6984	6985

Transmission meaning of

6986	6987

Summary: Three ways to transmission. 7015, 7020
Bears Problem of the
6988	6989

Dummy signals Signal necessary for Symbols necessary

6990	6991



6992	6993


Summary: The Problem of the Four Bears, solved. 7054, 7078
6994	6995

Summary: Casual analysis, Four Bears. 7167

6996	6997


Cause cause analysis
6998	6999



7000	7001

Interaction as operation

7002	7003

Summary: Cause Analysis. 7007, 7027, 7167
Summary: The Two Tracks, solved. 7077
7004	7005

Summary: Mere broadcasting induces high-order interaction. 7097 Broadcast gives interaction Broadcasting gives interaction Interaction by broadcasting
Constraint mechanisms for
7006	7007



7008	7009

Joining and interactions

7010	7011

Metric in a system
Constraint synthesis
7012	7013

Summary: Achieving constraints with physical systems. 7053 (foot), 7077, 7146

7014	7015

Transmission analysis of
Constraint isomorphic channels
7016	7017

Information the identities of Multinomial measure of information

7018	7019

Summary: What are these identities of information theory? 7030, 7051, 7159
Summary: What is a "channel"? 7031, 7083
7020	7021

Coding Shannon's theorems

7022	7023


Summary: The core of Shannon's thinking.
7025	7026

Information Cause analysis

7027	7028



7029	7030



7031	7032



7033	7034


Summary: Discriminatory work. 7146
7035	7036


Complexity conservation of Conservation of Complexity Law of
7037	7038


Summary: Notes on Information operators.
7039	7040



7041	7042



7043	7044



7045A	7045B


Summary: [H, T, and Q] as operators that alter distributions.
7046	7047



7048	7049

Summary: Specifying an n-tuple in a distribution and on its components. 7170. Simpler example 7087

7050	7051

Summary: Blissard-type operations in the identities of information analysis. Blissard (calculus) Identities Blissard calculus
Summary: Energy for the earth as a steady state. Constraint Friedman and Leondes
7052	7053

Coordination requires coordination

7054	7055A



7055A+01	7055B



7055B+01	7055C


Summary: Coordination analysis.
7056	7057



7058	7059

Summary: Coordination with memory. 7064
Matrix random
7060	7061

Summary: Chemical gardens and steady states. Chemical garden making
Summary: Where the sample space comes from, in physiology. 7140
7062	7063

Coordination in shoal

7064	7065

Summary: Communication required to keep a shoal of fish together. 7068, 7067, 7084 Entropy of Gaussian distribution
Summary: Entropy of a Gaussian distribution. 7069
7066	7067

Summary: The Case of the Two (and Only Two) Volunteers.
Summary: "Keeping together" demands very little in communication.
7068	7069



7070	7071

Summary: Keeping fishes together. 7084

7072	7073


Perceptron Minsky and Papert
7074	7075


Summary: Minsky and Papert really get hold of the Perceptron. Coding problem
7076	7077



7078	7079

Summary: The Problem of Coding successfully stated.

7080	7081


Summary: The Coding Problem, even when asked only of binary relations, does not always admit a solution giving equality. 7086 Summary: A channel must be coded into and coded out of. Channel what is a channel?
7082	7083

Summary: Keeping a shoal together.

7084	7085


Summary: Coding coordination between three variables on to two channels.
7086	7087

1970

Summary: Transmission enters when an unordered set is distributed over a product space. Example 7092 Self-awareness in chimpanzee
Summary: Self-recognition. Information in design
7088	7089

Design informational cost

7090	7091


Summary: "Design" as a transmission of information. 7108 example.
7092	7093

Information in pulse and gap
Summary: No-pulse may carry more information than pulse.
7094	7095

Summary: Why allowing interaction boosts up informational demands. 7122, 7127 Information and interaction

7096	7097

Transmission repeated arguments

7098	7099


Summary: Informational identities when arguments are repeated, or equalised.
7100	7101

Summary: Interactions when there are repetitions. Interaction by copying
Model Conant's theorem
7102	7103

Summary: A worked out example of Conant's theorem on isomorphism in regulators. 7117
Games as noisy transmission Noise and games
7104	7105


Summary: Example of how much selection is required to make a system stable. Information required for stability Stability information needed
7106	7107

Summary: Numerical confirmation of the theorem relating input-constraint and design. 7115, 7123, 7127

7108	7109

Selection the whole process
Summary: The totality of selection and the pieces. 7126
7110	7111

Channel capacity Least Safe Least Safe Capacity
Summary: Examples of a channel that must have Least Safe Capacity, though transmitting less. Epistemology [56]: McCrea's "principle" (7113) "The less information we can get [about distant events] the less we need in order to make predictions that are testable by observation.".
7112	7113

Summary: An idea, not yet developed.
Design informational cost
7114	7115

Summary: Informational cost of making (designing) a channel.
Model applied to Watt's govenor
7116	7117


Summary: Conant's theorem on models applied to the Watt's governor.
7118	7119


Summary: The error-controlled regulator, and the doctor who is one patient behind in his treatments.
7120	7121

Summary: "Between" as subset (of a 3-dimensional) space. Between as ternary relation Relation of "between"

7122	7123

1971

Summary: Interaction between parts having inputs raises the complexity by x kⁱ. i = number of inputs to each part; k = number of values (states) of each part). Information and interaction Interaction increases information by x kⁱ
Summary: Me and my brain in dreams. Dream and "self" Self-awareness impossible
7124	7125

Summary: Transmission cannot be created. 7146 Conservation of Complexity Law of Transmission cannot be created
Information and interaction Interaction squares it (doubled size) Size, effect of on information
7126	7127

Summary: Among systems all of full interaction, doubling the size of the systems multiplies the information demands by the number of bits required initially.
HYFI (Hydraulic Feedack Imitator) design
7128	7129


HYFI (Hydraulic Feedack Imitator) equations
7130	7131



7132	7133

Summary: HYFI (Mark I), its behaviour and mathematics.[Hydraulic Feedback Imitator] HYFI (Hydraulic Feedack Imitator) pair of

7134	7135

Summary: Two units of HYFI (Hydraulic Feedback Imitator) cross-connected - maths of.
Network sensitivity Size, effect of on behaviour
7136	7137



7138	7139

1972

Summary: All large systems will tend to be insensitive, in their behaviours, to changes in size.
Summary: Why does Man's brain weigh just 2½ pounds ? 7143
7140	7141

Interaction and vector-formation N-tuple effect on Q Vector effect on Q
Summary: Thinking variables into vectors does not raise the order of the highest non-zero interaction.
7142	7143

Summary: In some cases "bits per second" may be less meaningful than "highest order of non-zero interaction". Indexed as far as Memory sentence with short memory Sentence with limited memory

7144	7145



7146	7147



7148	7149



7150	7151


Summary: Causal analysis traced back to natural (physico-chemical or other) laws as origin. (This last note has decided me to write up my collected ideas as a book)
7152	7153

Summary: The identities in H, T, Q remain identities if the letters are changed to script.

7154	7155



7156	7157

Summary: A collected list of laws (of all types). 7174

7158	7159



7160	7161


Summary: What Axioms 1 and 2 really imply. 7170, 7174
7162	7163



7164	7165


Summary: Example of causal analysis. 7174
7166	7167


Summary: The term expressing A's effect on the coding between B and C is the interaction [Q] (not the previously suggested Y_A[B:C])
7168	7169



7170	7171

Summary: Elements specified by n-tuples. 7182
Summary: Information analysis and the analysis of variance.
7172	7173



7174	7175


Summary: Application of the idea of conservation of energy varies widely in its obviousness. A collected list.
7176	7177



7178	7179


Summary: Where information analysis ("conservation of causation") might be used.
7180	7181


Summary: Forming a partition seems again to emerge as the fundamental operation.
7182	7183

Summary: Scientific study is just performing partitions.

7184	7185



7186	7187



7188	7189



7189+01	7189+02



7189+03	7189+04

These images are reproduced courtesy of The Estate of W. Ross Ashby. Copyright 1972, 2008 © The Estate of W. Ross Ashby