Professional Documents
Culture Documents
Impediments of Computation
2. There are only two primitive logic operations that are necessary and
sufficient, in combination, to perform the 16 possible static Boolean operations
between two operands: AND, a conjunction, and NOT, the operator of
negation, an adverb. These can be used or combined to perform logical AND,
NOT, NAND, OR, NOR, XOR, XNOR, as well as equate to certainty (1), and
null (0). The set can also perform binary arithmetic. All of these operations are
conjunctive, or coincident, in both space and time. “A AND B” is true if both
are present at one and the same time. When performed by physical logic
elements, the operations are considered to be executed in a null-time zone, as
the evaluations are ready at the next live moment (usually at the next clock
pulse or instruction), which is designed to occur after any contributing settling
times or gate-delays have run to completion. Boolean logic used in such a
manner is static, is unobservant of change, and can be said to inhabit the space-
domain. The time-domain is an untapped resource.
5. The order of events and the chain of cause and effect are usually much more
important than how many microseconds each condition lasts, or at what clock-
time each occurred in a process. Physical processes start, continue, and stop.
They have beginnings and existence extended in time. They end. They repeat.
Several conditions can overlap, with different start and stop times for each. A
natural language narrative (say, in English) can precisely describe a process
having these characteristics no matter how that process twists and turns over
time and in space, and all without reference to clock time, the increments of
which, in any case, are arbitrary.
Given the above observations, how do we “tell the process stories” using
computers with only AND, NOT, (and their combinations), and STORE? It is
demonstrably difficult and it is no wonder that software production for large
systems is only 50% efficient and can’t ship product guaranteed to be error-
free.
6. In the early days, the active elements of computers (vacuum tubes) were
large, expensive, and heat-producing. With the present level of integration and
integrated circuits having up to millions of transistors, there is little reason to
continue sharing common resources directed by a central command point such
as a central processing unit (CPU). Competition for resources slows the
performance of control functions. By their very nature, linear-sequential
operations actively obstruct parallel-concurrent operations.
9. The software designers live and work in native three-dimensional spaces and
time domains, while they are required to translate every temporal process
reference to the space-domain for data-processing after which they must
transfer the resultants from internal memory, which are space-domain
locations, to the active outputs and thereby join the ongoing time-stream. It is
no wonder they have a tough time shipping bug-free product. (See references
for “Software is Mostly Unnecessary.”)
The ten characteristics above describe impediments that designers should take
pains to design out of any new control systems and theories.
Ordinary logic begins and ends with static existence, non-existence, and
conjunction in both space and time. NML incorporates those factors of
existence and also manages the when of ongoing process. The underlying
assumptions of NML are: 1. No change happens without a causative event. All
things have an initiation in space, time, or space-time, at which cause-point the
creation of that effect takes place. 2. Once created or begun, a condition persists
until it ends (is changed into something else, is nullified, or destroyed). 3.
5
There are more temporal operations and functions than conjunction. Among
these are creation and destruction (as mentioned above), precedence and
succession, initiation, continuation, cessation, repetition, and concurrency.
NML is a logic system of thought and action that incorporates all of these
temporal concepts, and more, upon a background of continuous real time.
Copyright 2010
by c.moeller@ieee.org