Search

A source of ideas for automata theory — the study of the brain — has been pushed aside in mathematical development of the theory. This paper suggests the ways in which automata theory might evolve over the next 25 years if it is to contribute to an understanding of how the brain processes information. [ABSTRACT FROM AUTHOR]

Following the fixpoint theory of Scott, the semantics of computer programs are defined in terms of the least fixpoints of recursive programs. This allows not only the justification of all existing verification techniques, but also their extension to the handling, in a uniform manner of various properties of computer programs, including correctness, termination, and equivalence. [ABSTRACT FROM AUTHOR]

61 It is assumed that there is a similarity of function between the data names of a programming language and the file names of an operating system. The two functions are discussed in terms of the same basic concepts in order to identify the extent to which they overlap. It is suggested that there is some similarity between the idea of a file directory and a storable object of type context. Manipulations with contexts are then discussed at length. It is noted that there is a simple extension of Church's A notation that deals nicely with these ideas of context manipulation. Whereas a function can be regarded as the abstraction based upon the first two terms of the expression γ(namelist)(expression)(valuelist), it is found that a context can be viewed as an abstraction based upon the first two terms in the equivalent expression μ(namelist)(valuelist)(expression). [ABSTRACT FROM AUTHOR]

Discusses the development of a computational linguistic system based on pattern recognition and learning logic. Syntactic analysis of the structural relations among words within sentences; Use for parsing large quantities of English text with a maximum of accuracy and a minimum of ambiguity.

The article presents a simulation of the computer logic equations using Fortran arithmetic expressions. The simulation involved methods such as writing the equations for the logic for each side of the flip-flop which is an A-C coupled, set-reset device. The logic was implemented using the representative terms A, AN, ONA, and OFA, where A and AN represent the outputs of the flip-flop while ONA and OFA represent the set and reset impulses to A. A and AN are unaltered during an entire pass and at the end of the pass, a subroutine SET is called. A logical presentation of the simulation is presented.

This article presents information about a method for simulating logical functions in a digital computer by means of simple arithmetic and control instructions. This method is of practical value when the computer used does not have built-in logical instructions. In this method, it is assumed that x, y and z are integer variables whose value is maintained at 1 or 0 at all times. It is also assumed that A, B and C are Boolean variables whose value is either 1 or 0 by definition. The logical operations of AND, OR and NOT may be executed with the integer variables x, y and z using arithmetic and control instructions. The result of an AND operation with any number of Boolean variables is exactly the same as the (arithmetic) multiplication operation with the integer variables. The result of an OR operation is with any number of Boolean variables is the same as the arithmetic addition of the integer variables. The result of a NOT operation with a Boolean variable is the same as subtracting an integer variable x from 1. The OR operation needs a control statement after the arithmetic addition is performed in order to restore the value of the variable to unity. This may be simplified by using a function subprogram to calculate the result of the OR operation, thus eliminating the need for repetition of the control statements.

The article focuses on the writings of Edmund Burke. It is not surprising that in this plethora of ancestor fetishism, the name of Edmund Burke should be on the lips of its modern defenders. In many respects Burke reflects the conflicts which go on in every man who endeavors seriously to confront the dilemmas of politics. Burke's first principle has considerable validity, for it is an attack on the 18th Century tendency to assimilated morals and politics to mathematics and logic. One of Burke's greatest failings was in refusing to admit explicitly that any use of tradition and any application of prudence must necessarily occur within a framework of rationality.

The article presents several quotes about commands.

Presents a quotation about dilemma.