The input workload of an irregular application must be evenly distributed among its threads to enable cutting-edge performance. To address this need in OpenMP, several loop scheduling strategies were proposed. While having this ever-increasing number of strategies at disposal is helpful, it has become a…
Consider the collection D of first-order formulas α such that the first-order theory with axiom α is decidable. It is proven that D is neither r.e. nor co-r.e. (The second part has been known earlier.)
The article consists of two chapters. In the first part of the first chapter, the author rediscovers well-partial-orderings and well-quasi-orderings, which he calls tight partial orders and tight quasi orders, and develops a theory of such orderings. (In this connection, it may be appropriate to…
Delimiting the decidability result of [3] for linearly ordered abelian groups and answering Malcev's question, we prove the theorem in the title.
In this pioneering study, the authors deal with the nature and theory of meaning and present a new, objective method for it's measurement which they call the semantic differential. This instrument is not a specific test, but rather a general technique of measurement that can…
This paper describes the design of the computer seen by a machine-language programmer in a time-sharing system developed at the University of California at Berkeley. Some of the instructions in this machine are executed by the hardware, and some are implemented by software. The user,…
In the summer of 1966, I worked at the M.I.T. Artificial Intelligence Laboratory, doing Lisp programming for a computer vision project. I have no memory of this document, but it appears to describe the programs I wrote that summer. It's of no technical interest, but…
The word problem for finite semigroups is the following decision problem: given some number n of word pairs (u1,v1), ..., (un,vn) and an additional word pair (u0,v0), decide whether the n equations u1=v1,..., un=vn impliy the additional equation u0=v0 in all finte semigroups. We prove…
This is an English translation of 3.
We prove that no universal first-order property distinguishes between any two ordered abelian groups.
This appears to be my first publication, written when I was a high school student. It shows that I was not a child prodigy.
Eric Horvitz receives the ACM-AAAI Allen Newell Award for his contributions to artificial intelligence and human-computer interaction spanning the computing and decision sciences through developing principles and models of sensing, reflection, and rational action.
