Online research in philosophy

The fundamental assumptions in Dijkstra''s influential article on computing science teaching are challenged. Dijkstra''s paper presents the radical novelties of computing, and the consequent problems that we must tackle through a formal, logic-based approach to program derivation. Dijkstra''s main premise is that the algorithmic programming paradigm is the only one, in fact, the only possible one. It is argued that there is at least one other, the network-programming paradigm, which itself is a radical novelty with respect to the implementation of (...) problems on computers. And, as one might expect of a radical alternative, it shows much of the conventional wisdom concerning computing science, which Dijkstra variously attacks and dispenses, to be special pleading; not universals of computing at all. Finally, we explore what is known of this new paradigm in order to see what light it sheds on the fundamental problems that computing really does present to us. Not surprisingly, some become less problematic, some disappear altogether and others take their place, but, in general, it must be of benefit to modern computer technology to gain a wider perspective on the possibilities instead of seeing everything through the traditional tunnel of programming as formula derivation, and computers as the requisite, special type of symbol manipulation device. (shrink)

The notion of specification plays a key role in the developing science of computing. It is typically considered to be the keystone in the software development process. However, there is no single, generally agreed meaning of specification that bears close scrutiny. Instead there is a variety of different, although partially interlocking and overlapping interpretations of the term.We catalogue this varietal profusion and attempt to lay bare both the sources and consequences of each major alternative. We attempt to present the full (...) range of possibilities, and the biases inherent in each style of interpretation. (shrink)

This outstanding collection is designed to address the fundamental issues and principles underlying the task of Artificial Intelligence.

This paper argues that Information Theoretic Redundancy (ITR) is fundamentally a composite concept that has been continually misinterpreted since the very inception of Information Theory. We view ITR as compounded of true redundancy and partial redundancy. This demarcation of true redundancy illustrates a limiting case phenomenon: the underlying metric (number of alternatives) differs only by degree but the properties of this concept differ in kind from those of partial redundancy. Several other studies are instanced which also imply the composite nature (...) of ITR. We thus provide broadly based but particular support for earlier generalized suggestions that it is the underlying calculus of Information Theory rather than the ill-named concepts themselves that provides something of a unitary language for the description of phenomena. (shrink)