Notes
[Notebook: DB 62 Interpretation]
[Sunday 16 December 2007 - Saturday 22 December 2007]
Sunday 16 December 2007
Monday 17 December 2007
Tuesday 18 December 2007
[page 75]
Wednesday 19 December 2007
The RCC business plan is to develop its power by offering an unverifiable promise of eternal life in return for a lifetime of obedience.
We maintain that death is final, but the Catholic story has been very widely believed. We can
[page 76]
attribute this to timor mortis, but it is worth examining it more scientifically, and seeking models that will help us decide if eternal life is possible or not. Timor mortis conturbat me - Wikipedia
The physical quantum of action is the smallest [and most abstract, ie least meaningful] there, but there is quantum of action at all scales, the point at which something is finished, that is an open question is closed [or a contract completed]. So a life is a quantum of action and the network model shows clearly how large quanta of action are constructed of small ones, beginning with h.
Metaphysics: quantum mechanics agrees with Christianity and many other ideas about the Universe by postulating an invisible reality which controls the visible. The principal difference is [that the Christian controller] is considered to be other than the world, whereas the quantum mechanical version is part of the world. Quantum information theory takes this invisible controller very seriously and entertains the idea that it is more powerful that the theoretical classical computer through its ability to process all frequencies of a signal (ie all of its constituents) in parallel. Listen to many things at once and deal with them.
It is relatively easy to understand the material constraints imposed by bearings, surfaces and other physical mechanical constraints. Here we replace these with logical constraints which are just as strong as physical constraints and (we guess) in the complete theory, explain physical constraints like gravitation, electromagnetism and the strong and weak forces.
[page 77]
We want to explore 'logical binding' within the parameters of uncertainty. The binding arises because every uncertainty is ultimately closed [resolved] and the debts are paid s in tunnelling. As in the banking industry, we borrow and repay money in order to finance technological developments that remain in existence after the debts are repaid.
This is the defining feature of the transfinite network, which because it embraces all possibilities, remains invariant [as a whole] no matter what transitions take place within it.
Thursday 20 December 2007
Friday 21 December 2007
Having introduced energy into the Universe via the not operator corresponding to the procession of the Son from the Father, we now take the Son and the Father as two points in a space and introduce the Spirit as the love (ie communication) between them, giving us a system with one bi-directional dimension of space and one dimension of time, which has as yet no preferred direction. We cannot say before and after, only that now is not then, then being indifferently in the future or the past.
I am way out on some sort of limb here, but like a person on one of those whirlygigs at Luna Park, must just stick to my principles and press on with interpreting the phenomena around me as best I can, applying my personal experience as a growing and
[page 78]
differentiating node in a network to the early Universe where the message is in effect the substance, as love and knowledge ate real personalities (sources) in the system.
Saturday 22 December 2007
The distinction between a computer and a network is arbitrary, since a computer itself is a layered network of communication processes.
We proceed in the order 0-space, 1-space, 2-space, 4-space, and then we have to dream up a reason why the system does not go on to higher real spaces, but instead tend to finite and infinite dimensional Hilbert spaces. Once we have 4-space, any two points can be connected without crossing, and the principle of least action may be interpreted as the principle of devolution, keep it local.
We should cast all this in terms of quantum information theory, making the connection between logic and physics via Nielsen and Chuang et al. Nielsen & Chuang
Loan and repayment: the industrial revolution was made possible by joint stock companies and banking.
Communication theory, quantum mechanics and computation can all be represented in function spaces, which is in effect the space of all possible mappings.
Computer network: interconnected collection of autonomous computers, Tanenbaum page 2. Tanenbaum
[page 79]
Optimization of a network depends upon the relative cost of computing and communication. Tanenbaum page 3.
Advantages of networked systems:
1. favourable price/performance
2. graceful degradation
3. incremental growth
4. communication versus energy
5. nodes = fermions / links = bosons
6. switching /transmission
7. network topology
How do we distinguish between real observable messages and virtual messages? A virtual message is something inside a node which cannot be accessed by other nodes. A real message is one that can be accessed by an outsider. Of course, since networks may be subsets of networks, the notions of real and virtual are relative to network boundaries.
'In the decentralized channel allocation method there is no central entity; each IMP (Interface Message Processor) must decide for itself whether to transmit or not. You may think that this always leads to chaos, but it is not so. Later we will study many algorithms designed to bring order out of the potential chaos. Tanenbaum pages 9-10.
peer process - layer n protocol.
Communication between peer processes is virtual through the real physical layer. T page 11.
Interface between layers. 'When network designers decide how
[page 80]
many layers to include in a network and what each one should do, one of the most important considerations is having cleanly defined interfaces between the layers. Having cleanly defined interfaces, in turn, requires that each layer perform a specific collection of well understood functions. In addition to minimizing the amount of information that must be passed between layers, clean cut interfaces also make it simple to replace the implementation of one layer with a completely different one (eg all the telephone lines are replaced with satellite channels) because all that is required of the new implementation is that it offers the same set of services to its upstairs neighbour as the old implementation did.' T pages 11-12.
This is the clue to eternal life: implement all the services of human life an an eternal substrate like a neutron star.
page 12: 'The set of layers and protocols is called the network architecture. The specification of the architecture must contain enough information to allow an implementer to write the program for each layer so that the program will correctly obey the correct protocol. . . . it is not . . . necessary that the interfaces on all machines in the network be the same, provided that each machine correctly uses all the protocols.'
In a network we wish to minimize the distance (measured in units of some resource) between transmitter and receiver.
Tanenbaum page 13: 'The peer process abstraction is crucial to network design.'
1. Establishing and terminating connection (contact)_
2. Simplex, half-duplex, duplex.[page 81]
3. Error control
4. Sequence control
5. Speed control
6. Length control - multiplexing and demultiplexing
7. Routing control
ISO Reference of Open Systems Interconnection.
Physical layer - raw bits
datalink - error detection and correction, producing error free
virtual line.
network layer - packing and routing, congestion control
transport layer - end to end via network intermediaries
session layer - connection + disconnection
presentation layer - compression, encryption, format conversion
etc.
application layer - users
page 37: 'A graph can easily be represented by a matrix M. The matrix elements equal to the capacity of the arc from i to j. If the graph is unweighted, Mij is one if there is an arc from i to j and 0 otherwise. If the lines are half duplex or full duplex, Mij = Mji. If self loops are forbidden, the diagonal elements Mii are all zero.
page 58: Queuing theory.
[page 82]
Tanenbaum page 59: 'Queuing systems in which the only transitions are to adjacent states are known as birth-death systems.
