Descriptive Peport of the Invention Patent named: "CIRCUITRY AND MICROPROGRAMMING OF A NON-VON NEUMANN COMPUTER FOR ACQUISITION OF AN AUTOMATIC PROGRAMMING (SOFTWARE)". The present invention refers to a circuitry (hardware) and a microprogramming (firmware) having Microelectronic devices, by using the Very Large Scale Integration tech¬ nology (VLSI), in order achieve mathematically an automatic programming (software), Von Neumann-type. It is generally known that the Computer Science development had its origin with SNANNON (1) on 9138, when he showed the way such a science could be applied to logic circuits to relays, the mathematic concepts of the Boolean Algebra, which were already known in that time, at about 90 years ago. Twenty years later, PHISTER (2) mathematically defined the General Model of a Digital System, which can be applied both to a phisical schema of circuitry (hardware) and to microprogramming (firmware), or even for an usual programming (software). See Figure 1. Such a system has a n-number of input independent variables: (X.) p/i=l,2, ...n; a m-number of output dependent variable: (Z.) p/ j=l,2,...m; and a "p"-number of inner variables (or feedback ones): ( ^v _k ) p/ k=l,2,...p. This system, which is presented by graphics in Figure 1, also can be shown by analysis, at the literal Boolean Algebra Language by means of the generic Boolean functions "(m + p)", thus forming a Simultaneous System of Boolean functions "m + p" to "(n + p)" variable, as follows: Z.. - fj (X _n ,...,X ₁ ,Y _p , ...,Y ₁ ) p/j - 1,2, ...,m and

Y, — f, X_ r • • • X-i # Y_/ • • • -i / P/k — 1,2, ...,p By inserting explicitly, in the expressions (1) the concept of "MATHEMATICAL TIME" which determined, in ac¬ cordance with MARTINS (3), the reappearance of a Kantian philosophy of Mathematics (4), it is possible to establish disjunctively, at the Input of such a general model, "2 x 2P = 2 " distinct mathematical times "t.", being i = 0,1,2, ...,(2 ^p ). For any of these times, the time "t." + Δt." will correspond in the output for each dependent variable "Z . (j=l, 2, ...m)" and for each internal variable "Y, (K=l.2....p) " . The expression (1) will become (2) :

Z.(t. + At.) = f .(X (t.),...,X _n (t.)),

Y (t _i ), Y (t.)) p/j-l,2,...m and (2)

L, (t. + k l A t _t ) = f _k (x _n (t _i ),...,x ₁ (t _i ),... ^γ .(t _i )) p/k = l,2...p; and i=0, 1,2, ... (2 ^n+p-1 ) Neverthless, the wide generality of such a model, in accordance with PHISTER (2), is responsible by the fact that the mathematical solution of the problem represented by the system was not achieved.

In the presente report we will try to show at the begining that, since the mathematical solution to the general model of a digital system was not found, the mentioned author (2) justifies a Cartesian "division" of this problem into other smaller problems, just as Von Neumann (5) had done on 1945, according to figure 2, designated as follows:

1. INPUT DEVICES (Or UNIT) (e.g. Keyboard, readers etc);

2. OUTPUT DEVICES (Or UNIT) (e.g. monitor, printer etc); 3. MEMORY UNIT (M.U.);

4. ARITHMETICAL UNIT (A.U.);

5. CONTROL UNIT (C.U.);

In details, the relationship of these UNITS, constituting the permanent subsytems of the Von neumann machines and by calling those "Boolean variables" as Boolean arithmetics variables", or "BAVS" respectively: internal

"(Y ), to k = 1,2, p"; independent "(X.) to i = 1,2,..., n"; and dependents, or, also, by calling them as "Boolean arithmetic functions", or BAF'S "(Z.) to j - 1,2,...m", we have: stored in the Memory Control Lines !

Memory Unit

Data read from BAV s(γ _k ) Ruling the data storage the Memory. and reading

Computer.

Data to be sent Outout Device Control Lines from the outside BAV'S (Z_.) |-Ruling the data storage

Data sent to the within Computer and its output devices outside arrangement (to outside)

Control Lines

Ruling the data trans¬ ference toand from the arithmetic unit, and determining the opera¬ tions to be sent to the outside

In the decade pf 1970, there were a fusion of the Control Units and the Arithmetic ones (C.U. and (A.U.), which constituted the present Microeletronics Microprocessor, according to Figure 3.

Such a "Von Neumann deviation" in relation to the healty ways of Mathematics caused, however, the achievement of a technological solution permiting the evolutive appearence of the four generations of computers, like "Von Neumann's machines".

Presently, new ideas are intensively searched, in order to establish a new computational architectonic frame, so that to allow a solution to the parallel computing. Even with the adoption of the multiple processing, ac- cording to Figure 4, the conventional computers are restricted to the serial processing, because of the need of the central control and the communication based on addressings withing the main memory. Such a present frame, constituted by "Memory/Processor" links, among which the Control Unit is interposed, some¬ times denominated by Von Neumann's "bottleneck", forces a serial running, even if parts of the program could be processed in parallel, that is, at the same time.In other words, when adopting the multiprocessing, the conventional computers and microcomputers are always limited by the serial procedure, because of the need of the centralizer "control" and communication based on addressings inside the big memory. Furthermore, such a circuit contingency which came from these Von Neumann machines, also caused a "Von Neumann style of programming", in accordance with BACKUS (6), bei ng such a circuit contingence responsible by the high cost, which represents today the half of the overall cost of its development. The "Cartesian method" as suggested by Descartes and used by Von Neumann on 1945, being mantained up to the present days, constitutes thus in the technological adoption of a "nonmathematical solution to the General Model of a Digital System. The reasons shown by PHISTER (") for justifying the nonacquisition of a mathematic and general solution to the problem were not sufficient to impede our researches in this field, which were conclusive. The acquisition of the mathematic solution to the Digital System General Model will now permit to re-concept the entire problem, deviated since 1945, from that mathematic tracking which was started by SHANNON (1). Paradoxically, such a mathematics absence, which allowed the significant

development of the Computer Science, passed to require in its increasing and wide use of the Logic for the Artificial Thought, more fundamentals of the used scientific truth. In order to attest such an assertion, the article (7) shows the effort of every developed nations tosolve the problem inherited from Von Neumann, also revealing that such a development of the Computing Science led us today to a true "4th Great Crisis if Mathematics" (8) The mathematical solution found in our researches, besides representing the solution to this last crisis in the

Mathematics Fundamentals (4), allowed the achievement of the objectives described in this invention (9), by discovering the Boolean Arithmetics (10) and the Technical Linguistics (11), which determined the appearence of the "Esperangol" (Direct and Reverse) (12).

"Von Neumann's deviation" of the mathematical solving for the digital system general problem led us to a circulation functional architecture, in which both Microprocessor and Memory Unit constitute always two permanent subsystem of the generalmodel. By imaging now a real time digital system, the following subsystems might be inexisting as interfaces: "1. input device (or UNIT)" and "2. OUTPUT devices (or UNIT)" and therefore Figure 5 would remain, in accordance with (13), where (A) and (B) are the two permanent sbsystem mentioned (microprocessor and memories), and (C) is the general Model of the digital system. Figure 6 shows how the present mathematical definirion could be for the "Von Neumann-style Programming" (6) and how it would be possible to have it autho atically (that is, via calculus algorithm) , by solving as a consequence the

Boolean equation which was "prepared" by the following concerned logic implication:

(A) (B) = (C), where one has the following: (3)

(A) : antecedent subsystem, being represented by the microprocessor;

(B) : consequent subsystem, being represented by the

memory unit; (c): generaldigital system, as a result of the logic implication indicated in (3). In order to clear the mathematical formulation indicated in Figure 6, letδs represent it in Figure 7, by evidencing graphically the loops of digital feedback, thus justifying the mathematical representation of the subsystem as well as the digital system, as indicated in (3). The new situation would be the following, according to the arithmetic notation diculged in (14):

Antecedent subsystem (represented by the microprocessor) :

- Boolean arithmetic notation : (A)p x „2 ^p

- Boolean algebraic notation: (Y. (X., Y,t ) ), where

K = 1,2, ...,p: and i = l,2,...m Consequent subsystem (represented by the memory unit) :

- Boolean arithmetic notation: (B) (,m +,

- Boolean algebraic notation: (Z 1., Y,K ( where k = 1,2, ...,p; and j = 1,2, ...,m.

General digital system (Von Neumann's machine): - Boolean arithmetic notation: (C) , _x „n+p

(m + p) x2 ^{■ c}

- Boolean algebraic notation: (Zj, Y, K (X.,Y )) where l — 1,2, ...,n; j = l,2,...,m; and K = 1,2,... ,p

In these conditions (3) will be arithmetically:

In Boolean algebraic terms it will be:

^(γ k ^(x i'V ⁾ - ^{( z} j - ^γ k ^(γ k ^{) }} - ^{( z} j - ^γ k ^{( x} i- ^γ k ^{) }}

(adopted) (incognito funcional) (given)

In such a fundamental Boolean equation of Von Neumann's machines circutry (software), the following terms will be mathematically known:

Antecedent subsystem: (Y, K-(X1., YK)) - Boolean functional, corresponding to the antecedent subsytem, being repre¬ sented by the microprocessor adopted by the manufacturer of Von Neumann's machine in question; General digital system: (Z., Y, (X., Y )), Boolean

1 K 1 K functional corresponding to the result of the logic

implication established in the equating of (5), which must represented in the final digital system, the emulation pretended at the time of the mentioned Von Neumann's machine Programming. In these conditions, assuming both terms of the fundamental Boolean equation as mathematically known (5), it would remain as a incognito Boolean functional the third term, represented in this case by the consequent subsystem, whose algebraic expression is Z., Y. (Y. ) , which should mean (in terms of Boolean

Arithmetic, or in terms of "machine mathematical language") the functional to be stored in the memory unit. It is interesting to note that, we will describe later how it is possible to achieve arithmetically the Boolean functionals corresponding to those known terms of the Boolean equation (5).

Therefore, in accordance with the description in (14), such a Boolean equation would have the following solution: (Z _jf Y _k (Y _k )) - ((Y _k (χ _i# Y _k ))) ^_1 (Z _j ,Y _k (X _i ,Y _k )) (6) nevertheless, the inverse of the functional above is really the correspondent analytical inverse functional. that is:

((Yk. (Xl., Yk )) ^"1 = (Xi., (7)

By substituting (7) in the second member of (6) we have:

- (Z., Y _k (X., Y _k (Y _k ))) - (Z., Y _k (Y _k )) (8) If we verufy the expression (8), we know that the expre- sion achieved as a solution to the fundamental Boolean expression established in (5), whose Boolean algebraic expression is the indicated (Z., Y, (Y _k ))

Such an expression will mathematically represent the functional corresponding to the "Von Neumann-style Program¬ ming" (the final object of the present patent), which, because of the well-defined calculus lagorithm, its com- putational determiantion (SOFAU) could called Automatic. According to our declaration, in order to achieve the

said SOFAU (Automatic Software), it is necessary to show the way of getting mathematically the Boolean functionals corresponding to those known terms of (5). As for the acquisition of the Boolean functional cor- responding to the microprocessor adopted by the manufac¬ turer as an antecedent system of (5), according to Figure 7, as if it were the matrix (A) „n+p) , we should use the laboratorial means of Digital Systems, by offering in the independent (n+p) BAV'S of the micro- processor input, some binary consecutive digital values, since "(n+p) zeroes" up to "(n+p)ones", by onserving the output "m+p" values represented by the Bits 0/1. This means, in terms of Boolean Arithmetics (10), to achieve laboratorially the "Numerical Transformed" (3) of the algebraic functional correspondent to the antecendent subsystem represented by the microprocessor in question, that is:

^(A) px2 ⁿ⁺ P =NT(Y _k (X., Y _k ))= ^

= (a n+p, ,a.a.) p (n+p); W _v __ ) - ^{2 X} i ^Y k

In other words, the numerical values of the abscissa of this "NT" will be avhieved in Digital System labora¬ tory, by means of using some usual computational fa¬ cilities. These facilities, we repeat, should provide in the input of the microprocessor adopted by the manufavturer, sucessive binary values, since: (0...00) ₂ - (0 ^n+P ) ₂ - o up to (l...ll) ₂ =(l ^n+P ) ₂ -(2 ^n+P -l), and the correspondent output values have to be annotated, being generically represented by the binary number of "p" bits, which constitutes the abscissa of its "NT". As for the acquisition of the microprogramming to the functional corresponding to the General System, that is, NT(Z., Y (X.,Y )), the method to be use has been described in Book (15) and in the numerical terms of Boolean Arithmetics, the respective Numerical Transformed is represented by an expression like:

^(C) ₍ m ₊ p ₎ x2 ^n+p " ^N T ^(Z ., ^Y _k ^(X .,Y _k ⁾⁾ -

(10) =(C ₂ n+p_ ₁ , , C _{l t} C _Q ) ₂ n+p. ((n+p) ; ^w _{χ γ} )

X I in a Boolean arithmetic field of the cardinality "(n+p)" and ordinality W _{χ =} (X ,...,X _i , Y _k ,...,Y _k ).

In order to clarify the setting of the intended micro¬ programming capable of representing arithmetically the systeam Boolean analytical functional (2), which cor¬ responds to the "NT" of the functional relative to the General Digital System (Z 3., Y,i-(Xl., Y.K)), which will be recorded as firmware of EPROM'S (or in the machine mathematical language), will be performed through the Design Matrix Method (DM), preconized in (3). Never¬ theless, in order to get it, it was necessary to solve the General Digital System, represented in Figurel ac¬ cording to the concept given by PHISTER (2), directly, without the mentioned mathematical "deviation" adopted by Von Neumann on 1945 (5). This means that, in the expression (10), NT(Z 1. , YrC(X1.,Yr_)), corresponds to the "program-object" written in machine mathematical lan¬ guage, of the General Digital System, as a result of the logic implication (5) which is a "part" of the problem, representing the final numerical expression of the correspondent "Non-Von" program. Mathematically, however, we were only dispensing, for calculation purposes, the natecedent substem which corresponds to the microprocessor. See Figure 1 for illustrating the description above. In these conditions, we are now presenting a new compu- tational architecture, which is the architecture of the "Non-Von" generation, justifying the title of the book (15). An. immediate consequence of such a calculus pro¬ cedure is the rise of the consequent subsystem, "Memory Units" for the entire General Digital Systems, that is, the subsystem (B) becomes the own system (C) for "calcula¬ tion purposes".

As a result, while the former consequent subsystem (B) used, for example, the volatile memories RAM (Randon Access Memory) of the Microelectronics, now it is possible to use "nonvolatile" memory devices of the ROM (Read Only Memory) group, such as: PROM, EPROM, EEPROM etc.

Inthese memory devices, it will be now recorded the nu¬ merical transformed of the expression (10), achieved by means of the mentioned Design Matrix, described below. Figures 9, 10 and 11 represent briefly one of these machines of the "Non-Von" generation, called "ESC_-0(n,m,p)"

(16 and 17) .

According to description of the mentioned book (15), the "ESςXo (n;m;p)" eliminated the microprocessor of the present computational machines, as well as its infallible high frequence clock, remaining only its great memory and the respective input/output devices. Thus, the "Von Neumann's bottleneck" disappeared, establishing the pure parallel processing without any resource to its present softening, represented by the "bottlenecks" of its multiple microprocessors.

In case of industrial automation, we know, even the usual input/output devices are dispensed, since the input sensors electronically "cleaned" are connected directly to the input "pins" of their "EPROM* S", and the output actuators, duly amplified, leave the respective "pinnings" of those nonvolatile memories of the Present microelectronics. The own elimination of the present hight frequency clock and its occasional replamecent with a simple low frequency chronometer, represented by a variable "X _n " , which implemented the duration of stable inner states (SIS)of programme of their "EPROM' S", in the modality of intelligent logic circuits (ILC) of their running, contributed to make the "ESCl-O" a determinist, sequential pure asynchronous, and absolute realtime machine.

It should be noted that the output actuators can be also

amplied for purposes of using them directly in low voltage electric circuits usual amperage (from 10A - simgle or three-phase - up to 63A) and the industrial frequence of 60Hz by means of Transruptor & Quantor commercially available, which use in their control the 4th Technique called "Control by Quantified Pulses" (See Table in the following sheet).

The present system, besides the fact that it still use Von Neumann's bottleneck, imperilled all the existing com¬ putational language, stigmatizing them with the consequent "Von Neumann style of programming (6) . The machines belonging to the "ESC£θ" generation, however, use the linguistic, philosophic and mathematical consequances of the pure researches started at Polithe School of Sao Paulo University since 1957 (17), which introduced into Mathematics Fundamentals the concept of "Time" (4), which introduzed the new sections of Boolean Arithmetics and Technical Linguistics (12), causing the advent of the Boolean Mathematics.

This fact allow the introduction of the natural human language, directly into the bits of the "ESCXO", like a truly "ESPERANGOL" or " UNIVERSAL LANGUAGE" of machines, without any limitation as for the level of its intelec- tuality. Such an assertion has been technologically confirmed, when it was verified that the present micro¬ programming language (firmware) is the Boolean Arith- metics itself, even though its idealists and manufac¬ turers at the developed countries have nor felt this fact so far.

The book in question (15), Chaper 6, shows in details how to apply the present software to acquire the firm- ware of the microprogramming toits EPROM' S, free of any human error, as it is frequent to occur in the classic programming of Von Neumann' style. Nevertheless, such an use, called ILC modality, when implemented by means of the temporal variable "X _n " as it is described in the former item, sacrifies 50% of the internal capacity available in its memory. Another modality of programming these new machines is the Gray Code Routes for Robotizing (GCRR), where the internal "2 ^P " memories are interconnected, for example, to a Gray Code in its internal routes. These routes are oriented by an outside operator, by means of "p" digital

implementation of "n" input variables, whose digital standard identifies the SIS of the corresponding memory, thus allowing the free actuation at the output of its contents previously stored. Thus, it constitutes one "page" of an electronic book having (2 ^p ) independent pages, analogously structured, but the contents stored are not necessarily the same. In this case, the memories are organized in each page, like "Dimensional hypercubus (p) , according to Figures 12, 13 and 14, applied to the EPROM 2716: constituting an "electronic book" having 8 sheets with 16 free recordings, represented by Hexade¬ cimal numbers (Structured arborescente programming, modality: (GCRR) . The industrial automation, a sensitive free enterprise problem, pretenda to solve its cost problems in the manufacturing environment of its products, by optimizing its result and the classic solution of the Computing Science does not reach the small or medium sectors, in¬ volving the risks of great economic and financial migra- tions.

The solutions presented in this description does not involve "risks", since by means of its own engineers and technicians of its industrial sector, it can manufacture the new machine (ESQAO generation) for a minimum cost of its components, as required by its manufacturing automation. Furthermore, it qill micro¬ program the firmware of its "EPROM'S" in the field and properly, thus enjoying the advantages of the experts' cultural advancing, as well as the incredible cost reduction determined by such a "manufacturing automation", influencing positively the respective market of place¬ ment of its products.

It is evident that it someone makes an "electronic book" the same can, if fesired, organize an "electronic library", diversifying the specific subjects, thus constituting a true "knowledge base", whose utilization

can be done by simply reading the "pages" of the mentioned "books".

It is convenient tonote that The "EPROM'S" memories (as well as the RAM'S ones), because of the unusual utili- zation presented, may not only to perorm the sequen¬ tial and co binatory logics printed in their programs, but also these memories act as generalized logic devices. Thus, as a consequence, they may dispense "PLA/PAL", which are more expensive and restricted, having interna- ly "logic gates" and "flip-flops" which become now dispensable in view of the new concepts of Boolean

Arithmetics and the "ESCftO" technology. Figure 14 re-

3 presents an "electronic book" having (2 = 8) pages with

4 (2 = 16) SIS (Stable Internal State) each, in which hexadecimal numbers van be stored. A "ESQXO (n=3+4; m=4'» p=4)" could represent it, but "p=4" of the input variables "n=7" identifies the SIS of the corresponding memory.

It is convenient tonote that the Boolean mathematical algebraic expression of the 2nd member of the Boolean equation (5), that is (Z T., Y K(XX. ,Y K)), where: j=l,2,..., n; i=l,2,...,m; K=l,2,...,p, really represents tech¬ nologically, in these new machines ("ESςftO" generation) (15), the fulrealization of a new-known mathematical concept called "Finite State Machine" - FSM) , which alsowould represent, in the conditions of the General Digital System, an Asynchronous Sequencial Machina, in accordance with PHISTER's presentation (5) and Figure 1. Such a concept defines FSM as a quintuple, symbolically represented as follows:

FSM S =(X _i# - Yk; Z..; Y _k (X _± , Y^) ; Z.. (X _{± t} Y^) ) , where:

1) X. = (X , ... ,X. , ... ,X,) , are the input independent variables; 2) X = (Y , ... ,Y , ... ,Y ) aarree tthhee iinnternal variables, constituting the memories;

3) Z. = (Z ,...,Z.,... Z..) are the output functions;

4) Y, (X, ,Y, ), are the functions defining the next Stable Internal States (SIS) of the system;

5) Z.(X., Y. ) are the functions defining the next system

3 1 k ³ outputs.

Since these "Non-Von" machines are pure asynchronous, operating in real time, they can be always representa¬ tive of the "Flow Tables" correspondent to any sequen¬ tial subsystem, without losing the sense of the Total Internal State, wheter stable or instable (SIS/TIS).

Such a fact does not occur to the classic synchronous systems, where the changes among the internal states are controlled by clock pulses and, in these conditions, thecontents sense of the total stable internal state (18) is affected.

Mathematically, Figure 11 means that the "ESςXO (n;m;p) constitutes the technological implementation of the system Boolean functions, give by (1). As we could see at the begining, by introducing explicitly in these expressions (1) the concept of "mathematical time"we know that for any "mathematical periods" ("t") and the respective period immediately subsequent ("t.+t.") the system (1) becomes (2). The determination of a pretended microprogramming capable of representing numerically the analytical functions of the system (2), and which will correspond to the recording of the respec¬ tive firmware of the EPROM'S will be done by using the Design Matrix method, preconized in (3).

Such a method consists of easily establishing a complete arithmetic functional relationship for a given design (composed, for example, by several programs forming a software), among the following set of variables: a) independent "n" BAV's (input sensory variables) n' ' 2' X.) or

X. (X n-l'"" l' 0 ^{) -}

If a temporizing variable "X _π " were (or not) previously considered as an implement of the duration of its Stable Internal States (SIS): b) Feedback "p" BAV'S, responsible by the implementa- tion of the "2 ^P " memories, represented by the totality of the possible disjunct SIS'S;

^Y k ^(Y p' ^{* • *} ' ^Y 2' ^Y ι ⁾ '" ^* c) Dependent "m" BAV'S (or output BAF'S, that is,

Boolean Arithmetic Functions): _ . l ___j , . . . , Ls r _\ r _>- _t / j m 2 1 The systems functional relationship (2) willbe now re¬ presented by the following expression:

(z., γ _k ) = (x., γ _k ), ₍₁₁₎ where i = 1,2, ...,n; j = 1,2, ...,m; k = l,2,...p In these conditions, we can say that the Design Matrix (DM)is a table that allow to "equation arithmetically" theinformation about the behavior of the pretended Sequencial Interruptor Logic Circuit (SILC) and therefore, about the combinatory function system CILC (Combinatory Interruptor Logic Circuit), given by (11). A general sketch of the Design Matrix (DM) can be seen in Figure 15 for an arithmetic field of cardinality "n+p" and ordinality "W _n = (_ ....r .,...^ Y , ... -,Y-)" It is convenient to note that the notation upper/lower "barra" (for example: X/X) isa legend and means that the variable is excited (transmience 1 or impedience=0) , or a monexcited variable (transmience =0, or impedience = l), but in the output quadrant only the excited variables are registered, in order tosave space, as for example, the outputs (Z. Y, ) of the Figure 12; in this zone, the nonexcited BAV'S are, then, perceived by saving, for effect of its equationing in the project. By introducing in such a methodology the knowledges about SIS and IIS, we have: The feedback "p" BAV'S (Y , ... ,Y ₂ ,Y ) can implement "2 ^P " Stable Internal States "S " disjunct, where:

however we will say that there is a situation of stability that is, one phase of the SIS was reached when in rela¬ tion to the feedback BAV'V, the respective disjunction "k" designed to the output to the same disjunction "k" objectived in the input; if such a fact does not occur, one says that there is an IIS, that is, the pretended phase is not stabilized yet.

Briefly, therefore, the Design Matriz is a table where: Each line represents a combination of the internal BAV's: (Y ,...,Y_, Y ) (internal state)

The intersection alveolus isa section of the topological universe, representing a cell called Total State of the subsystem, in which th= following output BAV'S is located: Z , ...,Z„, Z ₁ and the internal BAV'S Y , ...,Y ₂ , Y, now indicate of the next internal state.

Thus, one can "draw" in the Design Matriz a logistic promenade for each pretended programming, which has a close connection to the correspondent graph. _.

However, this process for direct acquisition can become very laborious, and this is a reason for adopting a classic programming, with the purpose of getting a final result free of human error. As an additional procedure, we have the Semple and Esςao Programs, both indicated in the mentioned book (15) and the program "FAPE (Automatic Firmware for Esςao) , which we willdescribe later, nevertheless, the same method of Design Matrix can be applied, without using these programs, by utilizing a numerical sequence which follows exclusively the indica¬ tion shown in the correspondent graph, where all the "2 ^p " utilized periods are registered. It is convenient to note that, when we direct the applica- tion of the Boolean Mathematics for acquiring the auto¬ matic sofware (SOFAU) of the present programming.

called "Von neu ann-style programming", by BACKUS (6), it was necessary to dispense the antecedent subsystem (A), called Microprocessor, thus originating a new "Non-Von" computational architecture (Fig.9, 10 and 11), according to (15 and 16). This means that it was neces¬ sary to create a Boolean Mathematics in its more sensi¬ tive aspect in relation to the Computer Science, that is, the Boolean Arithmetics, isomorphic as we already said, in relation with the well-known Boolean Algebra, but for itself, dif not solve the mathematical problem in question, conditioning as a consequence, the develop¬ ment of the Computer Science to the above mentioned "Von Neumann's deviation". The full Boolean Mathematical solution, which we present, not only eliminated the "bottleneck" of Von Neumann (Fig. 4 and 5), but also eliminated the "Von Neumann-style" of programming, which constitutes the present software, making it automatic and therefore, allowing it to be acquired by means of a calculating algorithm. Such a possibility of getting mathematically the software corresponding to a "Neumann-style programming", by means of a well defined algorithm, in its final language (or the achine mathematical language), or course, will cause other discussion about the recording of programs, as it is used today, empirically.

The present characteristic of these empiric software is the fact that they do not demonstrate any protection against occasional failures in the future... It is usual to admit that "a current program is only good until the day in which a failure occurs"..., then, the program is repaired until a new occasional failure occurs (19). The programs calculated by (SOFAU), however, on account of being achieved by means of a mahematical procedure (which we had to create), will never show the kind of the failure above mentioned, because they running will bring obviously the mathematic certainty of their future

conduct, without presenting any possibily of failures at any time.

Such a symptomatic conduct of the present "Von Neumann- -style programs" simply reveals the above mentioned empirism, or the lack of Boolean Mathematics, a far consequence of the "Von-Neumann' s deviation", described above. Such a dispense (for reasons of calculation) of the Microprocessor subystem was only a mathematic/logical consequence, of these new fundamental ideas which will be a base for such a new "mathematized" Computer Science which reappears in the future domains of the Logic and the own Mathematics. However, it is valid to say that, this microprocessor, as a basic subsystem of the present computational architecture, belonging to the "Non-Von" generation, is only displaced in the internal hierarchy of the circuitry "Non-Von" which was presented here, in order to perform some routine and repetitive atten¬ dance tasks, in accordance with the instructions in the firmwares programming, introduced directly in the Memory Unit, by means of the Technical Linguistics (9 and 12), as well as the Esperangol (Direct and Reverse) (11). Presently, the introduction of the "program-object" (amchine language) in the machine memory (hardware) is done after the codifier treatment (firmware) (installed) within computer by the manufacturer) of the program (software) received at the begining, by means of any current nonreversible computational language ("Von Neumann-style" languages), and such a program becomes the program-source (Assembler) . This means that the mathematicalprocess indicated eliminates an old concept of the Computer Science, since it allow to present a programming directly in firmware, that is, its insertion to a machine mathematical language in the computer memory. This implies, technically to transform the present memory devices (RAM/ROM family, etc) into generalpurposes

devices, dispensing the present devices of PAL family, which, in addition to the fact they are expensive, they are also limited, since they depend on the restrictions imposed by the logic gates incorporated in the devices itself (20).

Furthermore, as we can see, we are producing the desired program in a "Non-Von style", being directly microrecorded in the Microelectronics Memories (in general nonvolatile ones), in a machine language, which on account of being achieved by means of the

Boolean Arithmetic, we called by "Machine Mathematical language", thus constituting a method of microprogram¬ ming (firmware) automatically this machine ("ESQ__0" generation) through the Design Matrix. As we will see later when we describe the Automatic an Rational Structured Programming (ARSP) establish¬ ing an Analysis of Automatic Transition (AAT) , by using as an antecedent subsytem, the State Transition Diagrams (STD), there is a second method to get a "NT" of the Boolean functional correspondent to the result of the technological implication represented by the expressions (4) and (5). We have impression, how¬ ever, that the Design Matrix method preconized in (3) ismore complete because it is direct, that is, it does not depend on any subsystem for its acquisition. The mathematical treatment indicated also presents another old idea represented by the existense of a high frequence clock, which is an "inheritance" of the first generation of the mentioned "Von-type machines, based on the basic implementation of their flip-flops according to figure 16.

Furthermore, the own existing technological solution represented in these researches the necessary instru¬ mentation in order to achieve virtually the mathemat- ical solution of the problem in question. In fact, the problem in question to which we present a finitary

mathematical solution in accurate numerical terms would depend sometimes on fatiguing classic computational pro cessings. So, the sence of the current "4th Great Crisis of Mathematics which we mentioned above. Without such a revelation caused by our researches in the field of Mathematic Logic, the mentioned crisis is evident, as for example, on account of the difficulty admitted by the O.T.A. Members in "achieving basic scientific advancements" or "when could these advance- ents be reached" (21).

As for the operation of the system, PHISTER (2) in his argument mentioned some "minor difficulties" for the synchronization of the data entry, by selecting the basic adoption of a sychronized high frequency clock controlling the entire system.

Nevertheless, such a synchronized system allow only probabilistic perception of the processing time, at equidistant values, in the ascedent or descendent edge of its variation, 0/1 or 1/0, without consider- ing any independent and intermediate information, according to Figure 17.

In this Figure 17 we draw a signal input "X _k ". in its temporal development, by presenting some pulses which are faster than the frequence pulses of the sychrjl nized clock X_, having as a result a well different output. One feature ^c these synchronized machines (SM) to minimize these problems is to operate with an elevated synchronization frequence of its clock, since the limitative conditions of internal interferences and parasitic capacitances which are stronger with such a frequency increase. Mathematically, today the Boolean Algebra is applied, for example, to the equationing of flip-flops. The temporized final variable "t, " (or "X ₀ ") is chitted, causing its final expression to be almost nonrepresentative of the reality of its actu¬ ation, in accordance with the graphic output of the

Figure 17.

In the contributions which we presented, such a syn¬ chronization will be not indispensable any more, but if a temporized variable "X _n " is adopted, for example, asynchronously, the time perception would be determinist to any edge variation (ascedent/descedent) , wheter for any signal " ^χ _k ", or the variable "X ". As a final result, we always have the same reproduction in the input signal, regardless the adoption of the temporized variable "X.", according Figure 18. This final result reproducing the signal received, will be a consequence to improve the quality of its running. The F.A.P.E. program (Automatic Firmware for "Esgao") above mentioned, permits to acquire the memory trans- formed (NT) of the functional (Z., Y (X., Y. ) ) , in accordance with (22), by means of a structured prograuiiing, created by Dijkstra (23 and 24), constituting a STD, that is, "State Transition Diagram". In this case instead of the mentioned "Design Matrix" method, we can use once more the General Model of Digital

System (Figure 21), which has been applied in order to explain the circuitry (Hardware) of "Non-Von" generation computational machines, with the purpose of applying it, now, to the Programming (software) problem, in order to get a racionalization and automation, free of any logic "failure". To that application we call P.E.r.A. (Automatic and Rational Structured Programming - ARSP) . In fact, such a programming states an Automatic Transition Analysis (ATA), which permits to acquire mathematical¬ ly the functional numerical transformed (Z 3.,Y.k(Xl.,Y,k)) given by (10)

Thereforem in addition to the method described ("Design Matrix"), we have now a second way of getting the Boolean functional correspondent to the result of the technological implication represented by the ex-

pressions (4) and (5), as well as, graphically, by

Figure 7.

But such a Boolean Mathematics we created, should only be applied to the rational acquisition of the classic

"Non-Von" programming. The component subsystem (antecedent and consequent), as well as the resulting system show another denomination, as follows:

Antecedent subsystem (functional)

(A) _pχ2 n+p = NT (Y _k ( _i , Y _k )). (12) which represents mathematically the State Transition

Diagram - STD.

Consequent subsystem (functional)

^(B) (m+p)x2 - ^NT(Z j' ^Y k <V>' ⁽¹³⁾ which represent the State Internal States (SIS) of the program to be equationed, in which the output values of the variable depending on the Programmed Digital System are stored, as a result of the logic implica¬ tion as follows:

^(C) (m+p)x2 ^{n+P = NT(Z} j' ^Y k ^(X i' V> (14) In fact, the expressions (12), (13) and (14) reproduce the generic expression used above (4) and (5), which we repeat:

<*> _px2 ^ntP <B> _(m . _p)x2 P " ⁽ C ⁾ _{ltttp) xa} "~ ⁽ 4 ⁾ or, substituting on (4), the expression (12), (13) and (14), we have

NT(Y _k (X _if Y _k )) NT(Z ,Y _k (Y _k )) = NT(Z _j ,Y _k (X _i ,Y _k )) (16) and therefore, in order to return to the Boolean Algebra field, it is sufficient to eliminate NT through the correspondent operation of "Antitransformed" or "Analytical Transformed", thus achieving (5), which now corresponds to (16):

Y _k (Xi, Y _k )) — Z.,Y _k (Y _k )) - (Z.,Y _k (X.,Y _k )) (16) (S.T.D.) (SIS) "Non-Von" Program It is convenient to remember that the result achieved ("Non-Von" Program) is presented by its respective "NT", which correspond to the prJ gram-object, written in

a machine mathematical language, microrecorded as a firmware in the EPROM'S, for example, from the cor¬ respondent "ESς__0".

The former system, which corresponds to the said STD, is in reality constituted by a set of "knots" (SIS states) and connections among these several "knots", which cor¬ respond to the transitions of states. Each transition is associated to a given Boolean function of the input signals (X. , ...X. , ... ,X ) or (X., to i=l,2,...,n. In each state, STD explains the interpretations of all the possible inputs. STD shows how to change for another state, in which these interpretations can be different; furthermore, it emphasizes the temporal sequence of the dialoge between the user and the system.

The State Transition Diagram - STD, togheter with the ourrent state, permits to answer some questions, as follows: a) What can be done afterwards? b) Where is the system located? c) How can we do in order to...

It is convenient to note that for each generic "knot" (A), of the (2P) possible SIS (Fig. 16), we must attend the three conditions (in transmiences) as follows: ^ 2 ^P (17) m f.(X , ...,X_) = 1 (18)

-_■ i n 1 i=l m ij(f .f ) = 0, (19) ι,i ij being the Kronecker number,that is,i j —-σij

= 1 and i = j —- c^ij = 0 the expression (17), (18) and (19), in Techical Linguistics can have, respectively, the following interpretations:

(17) m ^ 2 ^p :"The reality is constituted by a finite number of fact and states, being possible to cover all thepossible transitions to a given SIS, in a finite number of passages." ~

(18) --' fi. (Xn....,X2,,X.1) = 1 i=l "Never say half-truths, in order to prevent the oc¬ currence of indefinite transitions". ^~

£ ij.f _i (x _n ,...,x ₁ ).f _j (x _n ,...,x ₁ ) - 0 (19) i,j "There is only one truth. Two or more truths cannot exist at the same time, impeding the occurrence of inconsistencies accordingly."

(Y , ...,Y ₂ , Y ₁ ) is the feedback BAV'S (or states/ memory ones) .

These BAV'S determine (2 ^P ) Stable Internal States (SIS) (or memories), where the hexadecimal pairs ( ©_ ' ^• ; β ) to K= 0, 1,2, ..., (2P-1) are recorded, and relative to each output byte (having 8 bits) . This means to define linguistically and funcionally the relationship between those feedback BAV'S (Y ,..., Y ₂ ,Y..) (or memos) and the output BAF'S (Z HI,...,Z ₉ -_,Z. Λ.) interesting to the said microprogramming (firmware).

Mathematically, this means that we must state the fol- lowwing functional relationship:

(20) Z_, ...,Z ₂ ,Z ₁ = f(Y , .. j.,Y ₂ ,Y ₁ ), or in brief, (Z-.(Y _k )), or, according to Figure 7, the expression (21) (Z ,Y _k (Y _k )).

The FAPE program decribed above permits the full replace¬ ment - in a small or large scale - or the inter¬ locking logic applied to relays. Historically, this is a problem entirely solved by SHANNON (1), who started on 1938, the Computer Science (informatica), as we describe at the bigining, by using only the Boolean

Algebra knowledge. With the use of the Boolean Arith¬ metic, finally, it was possible to lead such a Modern Mathematics to the field of the present Computer Science. Nowadays, it becomes a Science using a mathematical linguistics, without any restriction of its use for big systems in the future, not only in the field of the /Electronic Interlocking", but also in the field of the full application of the Mathematical Logic, expected since Aristotle (25), and announced later more convincently by Leibniz, Kant and Boole, in the practical case as exemplified in (22), the FAPE Program used permitted, in a problem of signalization of railway yards, the full substitution of the logic to relays by the logic of the electronic interlocking, dispensing, on account of being a "ESQ-_0", the primary use of microprocessors in the circuits design. To those, on the contrary of its actuation on micro¬ computers, a simple function of checking the prin- ciples of a system fail safe can be expected.

Such a program is part of the solving for the Gener¬ al Problem of the Systems Engineering (GPSE) (Fig.20), having a sufficient numerical algorithm in its struc¬ ture allowing to achieve the mechanized solution to the expected logic deduction.

In fact, the new concept for the computational proces¬ sing of the Systems Engineering which we propose, ac¬ cording to figure 2$, requires a sequential data flow which turms, isomorphically, into more than three clas- sical levels known (the semantical), syntactic and lex¬ icon levels), as follows, as we propose: 1st) - (Semantical) Level; 2nd) - (Syntactic / GO) Level; 3rd) - (Logic) Level; 4th) - (Syntactic/RETURN) Level; and 5th) - (Lexicon) Level.

The semantical, syntactic and lexicon levels are usual¬ ly referred in the methodology of programming for interfaces, aiming to reduce its complexity and the complexity of the acquisition process. In the present case, in addition to the introduction of the Logic Level (The 3rd level), the syntactic level was now extended to other two levels, being one to "GO" (2nd level), applied to the interface of the human language to the numerical language of the Boolean Arithmetics, constituting the "Direct Esperangol" and the other, the "RETURN" (4th level), being applied to the interface of this to a human language, and constitutes the "Reverse ' Esperangol ' " . The introduction of the 3rd Level (logic) in this chance, as an algorithm, for example, provides the knowledge Base with the requirements pf the Boolean Mathematics, which permited the acquisition of the Theory of the Texts Deduction, described in (26) and so far, existing modestly in the several presentations of the program (PROLOG", based only on the millenary and Aristotelian "rules of inferences". In such a 1st Level (Semantical), the data flow, which can be originated whether from a Human System or a Technological one, provides at first some information to be treated, in case of human systems, through the Technical Linguistics (case of data input in human language) and corresponds to the record for input data output format. In the 2nd Level (Syntactic/GO) the knowledges acquired, in particular, by the Boolean Arithmetic we introduced, turn those input computational data flow into "bits 'strings'", which correspond really to its numerical transformed or, machine mathematical language, as per our description above. This phase corresponds to the application of the said computational language as the

Direct "Esperangol", with the mathematical verification

of its own consistence during such a computational flow. In the 3rd Level (Mathematic Logic) there is the intro¬ duction of the general algorithm for solving any si¬ multaneous problem of Boolean Equations, which we deem our greatest contribution to the problem and we have announced it by means of several publications (26 and 27). In this phase, if the problem requires a mathematic-logic solution from the System intelligence, the algorithm inserted thereto will actuate, as for example, in the mentioned case of text deduction (26). Later, we will see that in certain applications, whether human or technological, we pretend to insert into the "Non-Von" automatic programming the logical certainty (nonexistent today) of its future conduct, without presenting "failures", today conidered as

"natural" to the system. This is the case of the re¬ vealed existence in the field of such a Modern Boolean Mathematics, of some "prohibited periods", inserted among the "periods" of permanence of the system stability (fig. 21) due to the fact that the general solution of a Boolean Equations simultaneous system is unknown to that period.

Those periods, which we also denominate "periods of... not to be...", are the periods in which the system is notrequested to leave .its any stable internal state "S _k ", or to change into "S " at the time of the function "f, (X ,...,X..)" occurrs, or into "S " when

"f2„(Xn,...,X_i.)" occurrs, etc, or into "Sm" in the case of the attendance of the function "fm(Xn,'...,X,1)", and they should intuitively remain stable in "S, ", but as we verified, they do not remain there, which cause the system to "deteriorate". For that reason, we also denominated them as "prohibited periods" and theconfirmation of their existence, besides to be a surprise (just as in another period, the period of the imaginary and fictitious mumbers),

was also a consequence of the general solving of Boolean Equation Systems which we found (26). In the 4th Level (Syntatic/RETURN) , the knowledge also acquired, specially by the Boolean Arithmetics, inversely transform the occasional "bit strings" originated from the precedent level, for some "math¬ ematic- logical deduction", by reverting them to the human language as an application of the reversible computational language we created, which we now call it Reverse "Esperangol". In such a case, the Minimum Effort, laws of the Technical Linguistics described in (11), thus achieving the correspondent text deduc¬ ted, as we can see in (26). In the 5th Level (Lexicon), there is the conclusion achieved by the System, within the rules preformed in the 1st Level (Semantical), causing that computa¬ tional flow, which became isomorphically during the described process, to return to the Technological Human System, as an exact science for the plenitude of its attendance, which now is possible.

It is interesting to emphasize that the Boolean Math¬ ematics, the Technical Linguistics and the "ESQftO" generation machines, originated from our researches, permited to reach a new p.hάlosophy of programming, which we call "Automatic Rational Structured Program¬ ming" (ARSP), where the Dijkstra's concerns (23 and 24) were eliminated in a first phase, by means of the using the general solution for the Boolean equa¬ tions systems (26) in fact, E.W.Dijkstra, who created the Structured

Programming, through his "shout" against "Go To Pro¬ gramming" on 1968 (23), wrote later some "letters for himself" which he published on 1972 under the title "Notes on structured programming", whose reflections and principles offered an increase in the ability of its use by the schedulers of the modern Computing.

In commenting our (the human' s)inability to "make" the major", Dijkstra affirmed that the greatest source of the difficulties existing in the programming is the differente in size between what we have in mind to program and what we utilize, for practical reasons, in theprograms of demonstration. For illustrating these assertions, he thinks very "beautiful" to exemplify the several techniques with small programs of demonstration and toconclude by saying:"... and when we have a program- ming having a size which is thousand times larger than the usual, it could be done likewise. The suthor concludes that such a difference of scales makes the task totally imcompatible; and historically, it has been shown that such a "beautiful finalphrase" constitutes a "truth" hard to believe...

The present reality (1989) 17 years later, showed the aggravation of the problem, because of the incredible and great difficulty for the programming (software) accompanying the crescent scaling of the existing microelectronic hardware, which marches to megabytes, terabytes etc. of the molecular electronics, causing the incipient and modest ingressions of this technology, in its origin, sometimes to be obsolete, in field like that of the railroad signalization. in fact, when only a machine is treated, as, for example, a microcomputer, a model having a more ad¬ vanced hardware is used as well. Furthermore, the existing programs should be adapted and the chances of getting a better software should be enlarged and, therefore, a better result can be expected.

Nevertheless, when a real time system is treated, as, for example, the railroad signalization, or even the industrial automation, the problem becomes more complex and the use of this more advanced hardware becomes more difficult and problematic, specially if the lack of new philosophies of wide scale programming prevails.

In this specific case that we exemplify (22), the railways were the first entities to introduce Logic in search of the solution for the problem of the safety in its trains, even prior to the advent of the electricity, as can be noted in its first signalization mechanical cabins and control of drill yards in railroad stations. The interlocking of the connecting lever for the railroad change switch and the respective mechanical semaphores show the historic railroader's preocupation in applying, since that time, the principles of binary logic for safety purposes.

The precocity of the application of the mentioned principles in safety and even in the automation of important systems, like the industrial and railroad ones, which today constitute the basic principles of the modern "informatica" (Computing Science), likely shows that the delay in its funcional use within the philosophy of the Computing Science can be related to the high cost/benefit of such a transformation in the existing traditional molds.

These new solutions constitute new facts that can sensibly reduce the current value of that cost/ benefit relation, whether by the incidence of minor costs, or by the increase of the benefits offered. Besides, the sector presents a crescent trend to a larger use of devices utilizing VLSI (Very Large Scale Integration) technology in railroad signalization circuits. The introduction of the Structures Programming after Dijkstra' shout (23), thus inaugurating the search of the programming "No Go To" (6 and 13), and one of the author of FORTRAN language, proposing an "Algebra for Programs" in order to release the present programming, in "Von Neumann style", which he himself aided to created constitutes another important contribution in search of the automatic programming, which these new

machines will be abble to after. Thus, with the presently available technology, these new machines can be also shown as universal technological executors of a "flow table" and as a result, the executors of the rspective "State Diagram", represented by a "Boolean Geometry" graph, in accoordance with the new language introduced by such a new "Boolean Mathematics" (12). However, the surprise reserved in the actuation of The program "FAPE" is detailed when, in several occasion, such a program offers some "suggestions" for modifying the data proposed by the scheduler, by showing its generic and intelligent character, face to the discovery of the existence of prohibited periods, among those in which a certain system may remain stable in any of its state (figure 210.

These suggestions, negotiated through the several solutions presented by FAPE program and finaU _* y accepted by the scheduler, eliminate technologically those oc¬ casional restrictions represented by prohibited periods, making the structures programming introduced into its memory microprogramming To be rational and automatic, whose respective table of recording is its final result. In fact, the existence of prohibited periods, among those in which a certain system may remain in its

Stable Internal State (S. ) (anyone), and the consequent suggestion for alteration of data, thus allowing its complete elimination, in addition to be a novelty, permitted to rationalize Dijkstra' Structured Program- ming", making the programming cf "ESς__.0" machines to be automatic, regardless its size, thus permitting a better follow-up, in relation to the incredible and crescent compactness of the hardware in the present microelectronics. The result achieved with the processing of the problem abcve mentioned as an example (22) now shows that, with

the modifications of the data proposed by FAPE Program, the said restrictions were entirely eliminated, making co patibe the interlocking proposed in the SIS corresponding to "S " knots cf STD. However, these results were not printed in detail in the program, simply because now there is the obvious certainty that, if the signalization system proposed in that state "S, " does not displace to any other state, then it should remain in "S. ". In accordance with a human point of view, these facts were intuitive... ...Never. leless, the Boolean Mathematics showed the "surprise" of the existence of "prohibited periods" among the "periods of 'not to be'", with the consequent "suggestion" negociated with the scheduler,aiming its complete "elimination" and establishing the "logic certainty" mentioned by Dijkstra and which may cause Linguistics to be an "exact science".

We affirmed precedently that the said FAPE program is part of the solution of the General Problem of the Systems Engineering (PGES) , mentioned in figure 20, havinc. in its structure a sufficient numerical algorithm, which allows to achieve the mechanized solution of the expected logic deduction. In fact, the introduction to "Esperangcl" (Direct and Reverse) was rot included in this produc, on the con¬ trary of the program we called "Bebe ϊndio" (I and II), constituting the example published in the clause (26 and 28). However, our contribution to the General Problem of the System Engineering (figure 11) consisted only in dividing the existing Syntactic Level into two other, respectively, the 2nd Level (Syntactic/GO), creating the Direct "Esperangol" and the 4th Level (Syntactic/RETURN) , creating the Reserve "Esperangol", interposing among them a new level (3rd Level - Logic Mathematical), entirely created for us, by means of the general solution of a simultaneous system of Boolean

equations divulged in (27). But these new sublevels (2nd and 4th) created a unique reversible computational mathematics language existing up to the present days, named "esperangol" (Direct and Reverse), causing the growth of the new subject which we name Technical

Linguistics (9 and 11), being now necessary some con¬ siderations relative to such a subject. The advent of the Boolean Arithmetic presented as a mathematical language, essencially numerical, isomorphic in relation to the Boolean Algebra, which constitute another language essencially literal, produced an extension of such an isomorphism to the Technical Lin¬ guistics, at the begining to its propositional calcula¬ tion (12). In the other hand, the Technical Linguistics uses the comcept of Hindrance, instead of using the dual con¬ cept of Transmission, where the affirmative means "to transmit tension, equals to one" and the negative means "do nor transmit tension, equals to zero. Such a fact is due to the analogy of the human blower apparatus, which operates in the base of air flow when released by the lungs, remembering the dual meaning, in the Technology, of current hidrances. In these condictions "do not impede air draft, equals zero" (that is, the negative of Logic) produces the sound of the word through its passage by the vocal cords, while "to impede the air draft, equals one" (that is, the positive of Logic) now is equivalent to "do not produce" the sound of the word, but, the occurrence of the "silence". The situation presented in figure 22 explains the questions in the human/technological human confronta¬ tion. This figure shows that at the domains of the Human Logic, the production of the speech occurs to numerical values of the Negative Logic, which charac- terize the interpretations of the Technical Linguistics, in terms of hindrances. Thus, the value of the null

hidrance corresponds to the Production of Voice, that is, "I = 0 (Negative)" and the Technical Linguistics presents the following interpretation: there is no obstacle of the air draft expelled by the lungs for passing through the vocal cords (closed glottis) ,causing them to vibrate and therefore, producing the sound of the voice (or phoneme). If the hidrance is not null, that is, "I - 1 (Affirmative), the Technical Linguistics presents the following dual interpretation: There is an obstacle of the air draft expelled by the lungs for passing through the vocal cords (opened glottis), and these vocal cords do not vibrate, thus producing the silence.

In fact, the task of the human blower apparatus consist- ing in the production of the speeck expressing thoughts, only at the time of exhalation of the lungs with the glottis closed and the necessity of its next inspira¬ tion caused the appearence of the need for a maximum of communication, by dint of a minimum physical effort, with suppresions of redundances, which justify the "laws of the minimum effort" of the Technical Lin¬ guistics.

Even the lexicon notations related to the ponctuation of the written text, having identical meanings in each grammar of any idion, show the universality of these same causes for the good understanding of the human communications, whether speech or written. In these conditions, by considering the description above, as for tie isomorphism established between the human propositions and their respective simultaneous version to the Boolean Mathematics (Arithmetic and/ or Algebra), in terms of the respective hindrances and vice versa, we inspected at the begining, some proprieties of Boolean Algebra (expressed in Hindran- ces) (29), as possible functions which generate the so called "laws of minimum effort" of the Technical

Linguistics.

These proprieties will be presented by means of the symbolic "Boolean variables" which will correspond, in the "Technical Linguistics, to the "linguistic variables" representative of logic concept perfectly defined and introduced in "E" space of the hypothetical mind, mentioned in (25), when in the phases of cre¬ ativity of the terms related to this linguistics. In oder to provide a better explanation, such a Boolean/ Linguistic variable will represent a strong nominal proposition or a propositional substantive capable of representing with no doubt those logic concep perfectly defined.

In these conditions we have: 1st) Propriety (quaalification) : X=0 or X=l, that is, : "Any Boolean variable "X" can always assume, qualitatively, whether the "0" value of a negative, or a "1" value of an affirmative". Therefore, those nominal proposition (without predicate) (or a proposi- tional substantive) will correspond now to the binary value of the Boolean variable "X", which represents an idea or enunciation of a judgement and which we denominate "linguistic variable"

I

2nd) Propriety (antonyme) : (X) = X, that is, : "The negative of the antonyme of a linguistic variable is the linguistic variable itself.

3rd) Propriety (Obvious): X + X = 1 and X.X =0, that is, : "Any linguistic variable cannot be connected conjunctively to its antonyme, resulting if it occurrs, in an always false proposition; nevertheless, if the connection is disjunctive, a poposition which is always true will obviously occur.

4th) Propriety (Comutativity) : ^x ι ^+x ₂ ^{= x + X} l ^and X, . X ₂ = X ₂ . X,, that is, "The linguistic variables when connected, whether by a conjuction "...and..." or a disjunction "... ,or, ...", enjoy the comutative

propriety, as for their comprehension" . NOTE: This last propriety introduces the linguistic concepts of "conjuctive connection" and "disjunctive connection" between two (or more) linguistic variable, which we detail below: a) "Conjunctive connection" is the conective "...and..." interposing between two linguistic variable, for example, "X_. and X_, being translated as the simultaneous presence in the space of the text understanding, that is, its appearance in a same period, at the same time. Its Boolean algebraic representation, in terms of hindrances corresponds to a Boolean sum "X_ + X _? ", b) "Disjunctive connection" is the connective "... ,or,..." interposing between two linguistic variables, for example, "X,, or, X~"f being translated as the monsimulta- neous in the space of the text understanding, that is, its disjunctive appearence in different periods, and therefore, sucessive. Its representation in Boolean Algebra, in terms of hindrances corresponds to a Boolean product, whowe two factors are placed in parenthesis: "X ).(X ₂ )".

The elimination of these parenthesis, according to the laws of the Boolean Algebra, is also in such a condi¬ tion in accordance with the interpretations of the linguistic text, as per its respective lexicon punc¬ tuations.

5th) Propriety (Pleonasm): X+X=X; X . X ■ X, that is, "Any repetition of linguistic variable, separated by the conjunction "...and...", or by the disjunc- tion "... ,or, ... , " means a redundancy (or pleonasm), and this is the reson for the elimination of this repetition." 6th) Propriety (Associativity):

⁽⁽ x ₁ ⁺ x _{2) +} j +...=χ +χ ₂ +χ ₃ +... _d ((x ₁ .x ₂ ).x ₃ )...«

= X. . X„ . X~...';. That is, "Three or more linguistic

variables, when connected among themselves, only by conjunctions "...and..." or disjunctions "...,0,..." can present them in the last connection only, subs¬ tituting the precedent one by mere "comma", without modifying their understanding".

7th) Propriety (Contraction): (X ₁ + X ₂ ) . (X ₁ +X ₃ )=X ₁ +X ₂ .X ₃ , that is, "When a linguistc variable "X " is connected conjunctively to other two "X " and "X ", in different periods, according to another disjunctive connection there will be a linguistic contraction in the text, by which only the first variable will be connected conjunctively to a new "contracted disjunctive connection", effected exclusively with both "X-" and ιιY II

^X 3 ^* This new contracted disjunctive connection" will be represented briefly by: "...or...".

By comparission to the precedent disjunctive connection

( ... ,or, ...") , we can note the lack of two "commas" at the side of the conjunction "or", meaning, in the correspondent Boolean algebraic expression, that the signals of "parenthesis" will be dispensed, between the respective literal factors.

NOTES: In these condictions, the connectives which join the linguistic variables are the following: _a ) "Conjunctive connective" is used when the linguistic variable are in the same "space" of the understanding, that is, when they are simultaneous, but not successive; this is represented briefly by "...and..."; b) "Disnjunctive connective" us used when the linguistic variables are in distinct "times" of understanding, that is, when they are successive, but not simultaneous; This is represented briefly by "...,or...", c) "Contracted disjunctive connective" is used when a linguistic contraction of the text exists, in ac- cordance with the explanation in the 6th propriety; This is represented briefly by "...or...".

8th) propriety (double contracted and pleonastic con¬ nection): X +X .X = X ; or X . (X +X ) = X , or "Any 1 1 2 1 1 1 2 1 conjunctive connection "...and..." of a linguistic variable "X,", with its contracted disjunctive con- nection "...or...", with another "X " will always pleonastic and vice versa".

The first part of this propriety is a particular case of the precedent propriety and the second part is reduced to the first, by applying other proprieties (See note below) .

NOTE: By the Boolean Algebra, it will be: i * - _j "'"X ' ⁼ X- .X. +X. ,X« ⁼ X. +X- .X.

9th) Propriety: (Pleonastic composition); (x ₁ +x ₂ ).(x' ₁ +x ₃ ) = (x ₁ +x ₂ ).(x' ₁ +X ₃ ); that is, "when a linguistic variable "X. " is connectec conjunc¬ tively to another variables "X " and its dual also is together with a third variable "X_", being both con¬ junction connected disjunctively, if another disjunc¬ tive connection exists with the conjunctive of these last two variables, we will have the fact that this last can be completely eliminated, without occurring any modifiation in the logic understanding of the text." As we can observe, the text corresponding to the 2nd member, if it does not have the final expression referent to the 1st member, its final understanding is not modified, since this propriety referent to the evidenced pleonastic composition has been applied. 10th) Propriety (Dual contraction); χ _ι+ χ i . χ ₂ = x. + ₂ or _j . (X J+X2) = ^x ι _' ^X ₂ ^{; or} '

(1st Part) "Any conjunctive connection "...and..." of a linguistic variable "X " to a disjunctive connection of its dual to another "X ₂ " will be always equivalent to the conjuctive connection "...and..." of these two variables".

(2nd Part) "Any disjunctive connection "...,or, ..." of a linguistic variable "X " to a conjunctive connection of its dual to another "X,", will be equivalent to the connection (disjunctive) "...,or, ..." of these two variables".

As for the isomorphism between the Technical linguistics anf the Boolean Mathematics, according to the reasons described above, we may conclude that, at the iso¬ morphical version of the linguistic proporsition for the Boolean Algebra, the operation "...+..." will correspond to the conjunction "...and...", in hidrances), and the operation "(...).(...)" (also in hidrances) will correspond to the disjunction "...or...", according to the example as follows: a) Linguistic proposition (Z_):

Z_: "To have a high profit and to improve the product". With the variable adopted (the boolean ones), X.: "To have high profit" and X : "To improve the product", the linguistic proposition "Z " will now the following "Boolean function":

(22) "Z ₁ = X ₁ + X ₂ b) Linguistic proposition (Z _? ):

Z : "To improve the product, or to exist planning". Boolean variables adopted: X„: "To improve the product" and X_: "To exist Planning"

In these conditions, the linguistic proposition "Z" will be, now, the following "Boolean function":

(23) "Z ₂ - (X ₂ ) = (X ₂ ) . (X ₃ ), or, only: "Z ₂ = X _2* ^X 3" The (isomorphical) version of the simultaneous system formed by these two Boolean functions, (22) and (23), to the Boolean Arithmetics, is dpne by adopting a numerical field of cardinaly "K = 3", ordinality "W ₃ = (X ₃ X ₂ X ₁ )" and by performing the following

Truth Table (See Table 1)

TABLE 1

In these conditions, we will get the following "Numerical Transformed" (NT) of the given system and in the mumer- ical field selected:

^Z l ^{= X} l ^{+ X} 2

(24) NT and = (3320 2220) (3; ^X 3 ^X 2 ^X 1

Transitivelity, we can say now, we established by extension a rational isomorphism between those two linguistic propositions "Z, and Z," and its respective numerical transformed, given by (3), where we have,

(25) NT (Z _χ ) - NT (X _τ + X ₂ )= (1110 1110) ₂ . (3;X ₃ X ₂ X ₁ ) and

(26) NT (Z ₂ ) = NT ( ₂ -X ₃ ) = 1100 0000) ₂ . (S^X^) c) assuming the second linguistic proposition (Z«) is substituted by another (Z_), as follows: Z_: "To improve the product, or to exist planning, or both", the new "Boolean function" would be

(27) "Z ₃ = (X ) . (X ₃ .(X ₂ +X ₃ )", or, only "Z ₃ = X ₂ -X ₃

(χ ₂ + χ ₃ )".

The "NT(Z ₃ )" will be now as following (Table 2)

TABLE 2

(28): NT(Z ₃ ) = NT(X ₂ .X ₃ . (X ₂ +X ₃ )) = (1100 0000) ₂ .

Conclusion: NT(Z ₃ ) = NT(Z ₂ ) = (1100 0000) _2> O^X^) Such an equality can be confirmed by using the opetative proprieties of the Boolean Algebra; we have:

^Z 3 ^=X 2 ^X 3 ^{* (X} 2 ^+X 3 ^{) = X} 2 ^X 3 ^X 2 ^+X 2 ^X 3 ^X 3 ^=X 2 ^X 3 ^{+ X} 2 ^X 3 ^{= Z} 2

This means that the preposition "Z " is redundant to the proposition "Z " which represents a "linguistic minimization", achieved by means of the so caUsed "laws of minimum effort". However, and also on account of these "laws on minimum effort" of the Technical Linguistics, in its isomorphical version to the Boolean Algebra, we have that a linguistic "contraction" very justified corresponds to the disjunction "...or...". Such a linguistic "contraction", in terms of Algebra, will

be represented by the operation " " (i.e., a product without parenthesisO, in accordance with the example in the following proposition: d) Linguistic proposition (Z .) :

Z.: "To improve the product and to have a high profit, or to improve the product and to exist planning".

By adopting the same Boolean variables of the precedent examples, the linguistic proposition "Z." will be now the following Boolean function:

(29) "Z ₄ ) = X ₂ + X_). (X ₂ + X ₃ )"

Its Numerical transformed will be the following

(Table 3) :

TABLE 3

NT(Z ₄ ) = NT ((X ₂ + X _χ ) (X. V - (1110 1100),

. (3; X ₃ X ₂ X ₂ X ₁ )

(30) : NT (Z ₄ ) = (1110 1100) ₂ (3; X ₃ X _2X;l )

However, according to the "laws of the minimum effort" of the Technical Linguistics, the proposition "Z " can be minimized without any loss for its understanding, by turning into the following ( _j .).

Z : To improve theproduct and to have a high profit, or to exist planning" .

In these conditions, we have the following Boolean function:

(31) "Z ₅ " = x ₂ + X . x ₃ "

It is convenient to note that in the proposition "Z " the repeated expression "To improve the product" was eliminated, as well as both "commas" which were located at the side of the disjunction "or", being thus needless to use parenthesis, as per the algebraic expression (31).

The Numerical Transformed "NT (Z_)" will be identical! to "NT(Z ₄ )", in fact (Table 4)

Xf _. _E_4 Ti refore:

(3? NT(Z ₅ ) = NT(Z ₄ ) = (1110 1100) ₂ .(3; X ₃ X ₂ X^ cor. lusion: In the Boolean Algebra, it is equivalent to

(33) Z ₄ = (X ₂ + X ₁ ).(X ₂ + X ₃ ) = X ₂ + X _j .Xg = Z ₅

Briefly: The proposition "Z " is redundant to the proposition "Z_", which represents a "linguistc minimization" which is achieved by means of the so called "laws of the minimum effort". Suppose now the linguistic proposition "Z,." being slinghtly modified, by re-writing with the disjunction "or" between commas, that is, we must have the fol¬ lowing and new proposition (Z _fi ):

Z,: "To improve the product and to have a high profit, or, to exist planning".

Obviously, the propositions "Z " and "Z,2 are not identical. In fact, in "Z ", there were a linguistic "minimization" or "contraction" as mentioned, of "Z ", without any demages to its understanding, that is, by (33): "Z ₄ - Z ". In the other hand, the Boolean algebraic expression in hindrances of the proposition Z _g will be: (34) Z ₆ - (X ₂ + X _χ ) . X ₃

By comparing now "NT(Z _t -)" and NT(Z _fi ), in hindrances, we will confirm the linguistic differences mentioned above the following (Table 5) :

TABLE 5

Therefore:

(35) NT (Z ₅ ) = (1110 1100) ₂ . (3';_ X ₃ X ₂ X _χ ) and(36) NT (Zg) = (1110 0000) ₂ . (3; X ₃ X ₂ X ) That is, NT (Z ) ≠ NT (Zg) Z ₅ ≠ Zg

(37) 1st) Conclusion: Z 4. = Z5 _c ≠ Z _c 6 (in hindrances)

The considerations above are sufficient to justify the natural use of the Negatibe Logic in Linguistics, thus forming the EXACT, that is, without any dubiety in its mathematical versions, Boolean (algebraic or arithmetical) However, only for a finalillustration, we will see how would these version be, if we use theconcepts of Transmission, as per the usual ways of the Electronic Technology (positive Logic):

Proposition Z : To improve the product and to have a high profit, or, to improve the product and to exist planning" :

By adopting the same Boolean variable above used, we would have the following Boolean function (in Transmissions):

(38) Z ₄ = X ₂ . x + X ₂ . X ₃

Proposition Z_: "To improve theproduct and to have a high profit or to exist planning". In the conditions above, it would be:

(39) Z ₅ - X ₂ . _Xl + X ₃

Proposition Z _fi : "To improve the product and to have a high profit, or to exist planning". In the conditions above, it would be:

(40) Z, = (χ_ . X. ) + X_

6 2 1 3

The respective Numerical Transformed would be achieved as follows (Table 6):

T&BLE 6

Therefore:

(41) NT(Z ₄ ) = (1100 1000) ₂ . (3; X ₃ X ₂ ^" _χ )

(42) NT (Z ₅ ) = NT (Zg) = 1111 1000) ₂ . (3; X ₃ X ₂ X ₁ ) 2nd) Conclusion: The improper use of the concepts of electronic Technology Transmissions, instead of the concepts of the hindrances of the Technical Linguistics, would lead us to the following ERRONEOUS conclusion, in relation to the same linguistics propositions above analyzed:

Z ₄ ≠ ^{Z = Z} ₆ ^ ⁿ Transmissions), which discords clearly of the precedent conclusion (37).

However, after achieving preliminarily the isomorphical version of the linguistic propositions in hindrances, to the Boolean Algebra and/or Arithmetics, it will be always possible to present the respective Numerical Transformed, also in terms of Positive Logic Transmis¬ sions, by means of the following redaction of trans¬ formation:

In a same arithmetical field (n; Xn...X2.X1-,), the Arith- etical Boolean Function (ABF) given by (43),

(43) NT _(T) Z(X _n , ...,X ₂ ,X ₁ )) =( in hindrances) will be always equivalent to the new ABF given by (44) .

(44) NT _(T) (z(X _n ,...,X ₂ ,X ₁ ))= in Transmissions)

In these conditions, the NT's presented above in hidran¬ ces, given by expressions (24), (25) and (30) would be now, the logic equivalent of the following new NT's presented in transmissions, according to (44): See Table 7) .

This means, as per a Boolean Mathematics point of view, that it is indifferent to operate with its algebraic and/or numerical expressions represented in hindrances or Transmissions. The obligation of using the hidrances, for reasons of accuracy, shoud prevail only in versions of the propositions to the Boolean Mathematics and vice versa.

Technologically, in the Electrical Engineering these two concepts are used by electronicians (tension "trans- mission") or electrotechnicians (Current "hindrances), but meaning always an identical situation of the device used in the circuit switching, according we showed in figure 22. In this opportunity, we try to show the establishment of the isomorphism between the Technical Linguistcs and the Boolean arithmetics, by using the concepts of "Hindrances" of the Negative Logics, instead of showing the concepts of /Transmissions" originated from the electronic technology. This permit to eliminate the dubieties (if any) in its numerical calculus.

Furthermore, this numerical codification of the language can occur simultaneously with its sensorial perception, thus permitting the direct application of the algorithm of the general solution of a Boolean equation system, solving the General Problem of System Engineering (GPSE) according to figure 20. Such a solution, detailed in (26)

presents the deductions of text or solutions to the proposed problem, which returns to the human language by means of the reserve process of the isomorphism established, causing the Technical Linguistics, thus, to be an exact science.

The use of the Boolean Algebra in the Switching Logics of relays was introduced by SHANNON, as we described at the begining. We can say that, historically, this study was the "key" permiting the "opening" of Com- puting Science (Informatica, as it is called in Portu¬ guese Language), being represented by discovery and use of the artificial thought.

Since this time the incipient structural perception becomes very facilitated, so that the presence of the binomial SPACE/TIME in the areas of the human and artificial thought should also prevail in the area of interface to the abstract symbolical thought. Theretically, one of the greatest philosophers of the Middle Ages, Kan (1724/1804), dared to condition the existence of the Pure Mathematics to its reductibility in the essencial concepts of that binomial (30), pro¬ ducing some unforgetable controversies. By accepting the Russelian assertion that Roole was the discoverer of the Pure Mathematics, Shannon's work acquires the importance of a incontestable experimental fac of the predominance of the Kantian philosophy in the Fundamentals of Mathematics (1).

In the order hand, the advent of the Boolean Arithmetics (essencially numerical mathematic language), isomorphical to the Booalen Algebra (essencially literal language) produced an extension of this isomorphism to the Tech¬ nical Linguistics (12), thus completing the confronting situation _ epresented by figures 23, 24 and 25. In fact, figure 23 shows the correspondence in the Fun- damentals of Mathematics (area of the abstract sym¬ bolical thought) of the SPACE/TIME mathematical concepts.

to the analogous of the area of human thought (upper part of the figure) and the physical analogous of the area of the artificial thought (lower part of the figure). TABLE 7

Figure 24 schematizes the present approach of the interface existing between the human and the artificial thought. In figure 25, however, some divisions were introduction, being represented by the "Boolean Arith- metics" in the area of interface, causing the advent of the Boolean Mathematics and Technical Linguistics in the area of the artificial thought, thus creating new ways to be followed, in the direction of the artificial thought and vice versa. The studies and researches which lead to the presenta¬ tion of this patent complete the presentation of the "ESCAO (n.m.p)" as an ambryo of these furute (non-von" computing machines, alJ vowing its imediate use in the solution of problems of real time automation of a small and medium scale. In the other hand, the evolutive digressions of the human thought in the direction of the artificial one are briefly shown (17), in the dif¬ ferent levels of linguistic, philisophical, mathematic and technological considerations, going back to the days of yore until the present date, at wide lines.

In the last decades, the contributions of GEMMTC'Grupo de Estudos do Movimento Matematico dos Tecήologos", or "Group of Study of the Technologists' Mathematical Movement - (GSTMM") is detailed, by perceiving that they constitute the new "openings/ to acquire the so called "5th Generation of Computers. These new and surprising conceptuations in terms of hardware/software show the solution of the General Problem of the System Engineering - GPSE) and that the "ESgSO" should be extended as a visible tip of on iceberg.

However, this iceberg is constituted by the outstanding foundation of the Kantian mathematical philosophy (4), the Boolean Arithmetics (120, the Technical Linguistics (26) and the unusual present use of the microeletronic devices in pure sequencial asynchronous circuits, operating in absolute real time with the complete and

full elimination of Von Neumann's "bottleneck" and limiting devices and their indefectible clock. With the purpose of permiting a parallel estimation of the linguistic, philosophical, mathematic and techno- logical thought, in (17) a list of persons and facts is shown, which in somewise contributed to the evolution of the computers and the Computing Science itself. As a general appreciation of the use of those ideas in the present state of the Computing Science, we shown the figure 26, in which we offer a confrontation as for the circuitry/microprogramming/programming (that is, hardware/firmware/software), between Von Neumann's machines and the ESC&0, a "Non-Von" generation machine. In this figure 26, "S " (K=0,l,2, ...,9,A) represent the several activities involved, and "f " (j,k = 0,1,2, 9, A) the transmitions of displacement between these activities, leaving the ac¬ tivity "S." and rirecting to "S " .

These activities in confrontation to the respective outout transmition are the following:

"S ": initial activity, represented by the Programming in a structured human language; from this activity the following transitions are released:

"f _π ": when a solution to a simultaneous system of Boolean equations (SSBE) is used, by means of the Arithmetical Transition Analysis (ATA);

"f ₀₄ ": when the Software Engineering is used in the conventional manner;

"f _ng " : when the Planning and tests of Logics are used; "f ₀₇ " : when the planning and tests of langage are used; "f- " : when acting as a "monstupid" machine, on account of applying the solution of simultaneous systems of Boolean Equations (SSBE), in addition to the "Esperan¬ gol" (Direct and Reverse). "S ": an activity represent- ting a programming having the mathematic/logical certin- ty achieved through the Boolean Arithmetics;

"f ₁₂ ": when a "Non-Von Neumann" programming is used, as described in the text:

"f..": when the present programming "Von Neumann-style" is used; "f- _n ": when a "logical negociation"with decisions of¬ fered by the program is started, with the purpose of eliminating the "prohibited periods", according to Figura 21.

"S ": an activity representing the acquisition of the microprogramming in the Machine Mathematical Language (Firmware) ;

"f ₂ ~": when a record of the "ESCAO" memory is implemented ¹ ,- "f *': when the reverse consequent function of ABF (Arithmetical Boolean Function) is to be acquired by means of the Booalen Arithmetics in machine mathematical language. "S ": an activity representing the final technological achievement (circuitry/microprogramming/ programming in "Von Von Neumann style"); "f_ ": Microprogramming Maintenance (firmware) "Non- Von style of the "ESς_.0": "S ": Source-Program (assem¬ bler) . Translation by means of an intuitive logical language or conventional computational languages for siftware;

"f ₄₅ ": compilation of the "Source-Program", "S ₅ ": "Obejet-Program";

"f_ ": Conventional implementation by the Central Processing Unit (CPU);

"f_ ": Automatic Software - SOFAU; "Sg": Test of Logics; "fg ₇ ": Tests for languages; "S_": Language tests; "f_ ₄ ": Corrections;

"f -ιι: Operational Program; /y

"Sg" : Conventional technological Achievement of the

Program (Von Neumann style);

"fo_.b": Tests for Logics; "f_ ₇ ": Tests for the language;

"Sg": Final Probabilistic Technological Achievement of

Von Neumann style Program (hardware Von Neumann);

"f _qn ": Maintenance of Von Neumann style Programming

(software, the present conception);

"f„ ": Logical Corrections (these corrections are not 96 ³ necessary if "SOFAU" exists (f _5g "); "f _g ": Linguistic Corrections.

"S ": Introduction to Text Deduction; (the machine is not "stupid" any more), in this case, we use the Pro¬ gramming, the "Resolution of a Simultaneous System of Boolean Equations (SSBE)" and the "Esperangol" (Direct and Reverse), which we have to create, characterizing such a computational language as the unique reversible language until the present date. The present contribution, anyway, according to the output transition "f _nA " (figure 26), will enable the present computational machine to enroll in the period of the "monstupid" machine, structuring the "human memory" of an instrument having a larger acuteness, analogously to the achievement of the optical ap- paratus which permitted to enlarge the modest limits of the "human vision", thus reaching sensible areas, whether in relation to the microcosm or the macrocosm. REFERENCES

1. SHANNON C.E. "A symbolic analysis of relay and switcing circuits", trad. AIEE, n°- 57, 1939.

2. PHISTER, Jr. M. "Logical Design of Digital Computers", John Wiley & Sons, 1958.

3. MARTINS W.W. "Contribuiςoes ao estudo dos circui- tos logicos interruptores ( 1? parte)", tese para a Docencia Livre", EPUSP, Departamento de Engenharia de Eletricidade.

4. MARTINS, W.W. "Uma filosofia Kantiana de Matemati- ca", Biblioteca do departamento de Engenharia de Eletricidade, EPUSP, 1983 5. VON NEUMANN, JR J. "The EDVAC report", in Computer from pascal to Von Neumann", H. Goldstein,

Ed. princeton, NJ, princeton Univ. Press, ch 7, discussion, 1972

6. BACKUS, J.W. "Can Programming be liberated from The Von Neumann Stile", A arcg functional style and its Algebra of Programs", Com. of ACM, Aug. 1978, pgs 613 a 641

7. FITZGERALD, K 7 wallich, P. "Next generation race bogs down", IEEE, SPECTRUM. Rev. June 1987, pgs 28 a 33. 8. GORDON JR, C.K. "The third Great Crisis in Math¬ ematics", IEEE, SPECTRUM rev May 1968, pgs 47 a 52. 9. MARTINS, W.W. "Boolean Arithmetics: Implications in Mathematical Teaching, present. 3rd International Congress of Mathematical Education", Karlsruhe, Germany, 1976.

10.MARTINS, W.W. & LAPPONI, J.C. "Aritmetica Booleana (Qualitativa) ", Biblioteca do Departamento de En¬ genharia de Eletricidade, EPUSP, 1976. 11.MARTINS, W.W. "I_ogica Linguistica III: o isomorfis- mo booleano e as leis do minimo esforςo da Linguis¬ tica Tecnica", Rev. Ciencia & Cultura, SBPC, 1987, n2 39 (5/6) pp 489 thru 498. 12. MARTINS, W.W. "A Matematica Booleana e os pensamen- tos humanos e artificiais", Rev. Ciencia _ Cultura, SBPC, april, 1983, n°- 35(4): 427-431.

13.BACKUS, J.W. "Function level computing", IEEE,

SPECTRUM, Rev. August, 1982, pp. 22.27 14. MARTINS, W.W. "Funςoes Aritemeticas Booleanas de Funςoes Aritemeticas Booleana (FAB de FAB) e o seu problema inverso", Biblioteca do Departamento de Engenharia de Eletricidade, EPUSP, 1983. 15.MARTINS, W.W. "ESςAO (n.m.p): Urn Co putador Nao- Von Neumann", Cartgraf Editora Ltd., Campinas, SP, BR, 1985. 16.MARTINS, W.W. "ESQAO (n.m.p); Urn computador nao Von Neumann, rev. Ciencia & Cultura, SBPC, 1986

38(1): 23.29 17. MARTINS, W.W. & MARTINS, R.W.C. & Joffe, C. "ESςSO

(n.m.p): Um Computador Nao Von Neumann da 5 ^§ Geragao", rev. "clen. & Cultura", SBPC, August, 1986, 38' 8): 1315-1330.

18.ZUFF0, J.A. "Sistemas eletronicos digitals, organiza- ςao interna e projeto", vol 1, Edgard Biucher/EDUSP, p. 46, Sao Paulo, 1976. 19.HAMILTON, M.H., "Zero difect software: the elusive goal", IEEE , SPECTRUM, rev, March, 1986, pp 48.53

20. ARTINS, W.W. "Utilizaςao da EPROM em substituiςao ao

PAL", Jornal da Microeletronica, September, 1985, pp. 14-16. 21.0 A T (Congress' Office Technology Assessment), Uma ameaςa (desta vez seria) aos Japoneses", Jornal da

Tarde, Sao Paulo, 12/26/1986, pg. 7 & "Congress" technical arm: how's it doing?".

IEEE, Spectrum erview, May, 1989, pp.58.59. 22.MARTINS,W.W. _ MARTINS, R.W.C. "0 Emprego da Pro- gramaςao estruturada, racional e automatica na Mi¬ croeletronica", Rev. Cien & Cultura, SBPC, Junho de 1989, 41(6): 538.551. 23.DIJKSTRA. E.W. "Go to statement considered harm- full", a letter to the editor of "Communications of the ACM, 11(3) March, 1968, pp. 147.148. 24.DIJKSTRA. E.W. & DAHL, O.J. & HOARE ,C A R

"Structured Programming", Academic Press, London and new York (1972) 25.MARTINS W W "Logica Linguistica - 1 ^§ parte" Rev. Cienc. & Cultura, SBPC, August, 1984, N2 36(8):

1331-1349 26.MARTINS, W.W. "Logica Linguistica: deduςao de textos

II parte" rev. Cien & Cultura, SBPC, April 1985,

N2 37(4): 584-600. 27.MARTINS, W.W. "Boolean Equations Systems: a numerical method of solutions". The Journal of Symbolic Logic

Logic, nϋ 3, vol, 42, September, 1977, pp 460.461. 28.MARTINS, W.W. "USP cria "Bebe Indio" um software intel igent.e" , Folha de Sao Pa"lo, 07/31/1985. 29. CALEWELL, S.H. "SWtching Circuit and Logical Design",

Dohn Wiley & Sons Inc., New York, 1958. 30.KANT, E. "Critira da Razao Pura" , .Tecnoprint Grafica

Editora, Sao Paulo, Transl, Rodrigues Mereja

Ediςδes de Ouro, 1969.