Ross indexed the following pages under the keyword: "Convergence (of lines of behaviour)".

Summary: On the operation that brings the representative point to a particular initial state. 3846, 4628 Convergence (of lines of behaviour) Independence and convergence Independence types of Information convergence and Invariant three types 3792 3793

Convergence (of lines of behaviour) in random transformation Information in random machine Transformation random Variety and random transformation 4974 4975

Summary: Simplification by running together, or deleting, the elements of time. 5165, 5245 Summary: "Loss of control" in set theory. 5155 Control in set theory Convergence (of lines of behaviour) loss of control Derivative and set theory Information non-transmission 5152 5153

Convergence (of lines of behaviour) quantity of 5804 5805

Summary: I read the riddle of [Pavlov's] page 197. 6338 Summary: Clear example of how a Newtonian system, with no convergence by Liouville, may show strong convergence if seen by a simpler observer. 6627 Convergence (of lines of behaviour) and Liouville's theorem Liouville's theorem effect of simplifying Pendulum Lotka's set 6320 6321

Summary: Construction to get many compact confluents. 6347, 6362.9 Dispersion small confluents Summary: Convergence to equilibrium in Markov chain. Convergence (of lines of behaviour) Markov non-convergence Equilibrium even distribution, Markov Markov process / chain convergence (or bunching) 6344 6345

Summary: When [x'=Φ(x)], no convergence anywhere implies div Φ=0 everywhere. Convergence (of lines of behaviour) and [div F (=?F)] Divergence in phase-space Stability and [?F] Uncertainty analysis of 1,m Complexity of basic assumptions 6386 6387

Summary: When a mapping operates (a state-determined system) either: activity goes down or internal pattering increases. 6850, 6835. Examples: 6854 Summary: Under any (one) sequence of mappings either activity decreases or internal patterning increases. 6777 Convergence (of lines of behaviour) random Entropy rate of fall Mapping random, convergence 6774 6775

Summary: Thinly connected nets converge faster. If... Nothing can be inferred about two being easier than three unless we add an assumption about the zeroness of higher order interactions (independence of higher order probabilities.) Convergence (of lines of behaviour) in net Mapping convergence in net Network convergence in 6802 6803