Remarks of the In-Coming Editor

A digit memory task and a delayed visual aiming task were used in a test of resource capacity theories. These tasks were run either singly, with short- or long-retention intervals, or in pairs. In the dual-task conditions, the short version of one was inserted into the longer version of the other. Delay by itself had no effect on retention, but the dual-task combinations showed asymmetrical interference: Inserting verbal memory into the visual-motor delay had little effect on either task, but inserting the motor task into the verbal retention interval disrupted both. These results thus support neither single nor multiple resource models, but can be explained with reference to component processes in working memory.     

Remarks on the Case of Pamela

This is a discussion of Robert Grossmark's paper: “The Case of Pamela.” It emphasizes the trauma in her early upbringing and uses her own words to describe the severe damage this did to both her physical and her emotional sense of existence. It touches on the crumbling of her ability to trust, the dysregulation of her physical and mental economy, the substitution of false self personnae for the endangered real self, and the inevitable enactments that occur in a treatment of this sort. Though recognizing the remarkable help that this treatment afforded her, it suggests that a further phase of explicit negative transference is being postponed and might be necessary for the full completion of this treatment.     

Remarks on the development of computability

The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. It is suggested in Section 3 that a central item was the problem of generalizing Gödel's incompleteness theorem. It is shown that this involved both the characterization of recursiveness and the attempt to clarify and formulate the notion of an effective process as it relates to the syntax of deductive systems. Section 4 concerns the decision problems which grew from the Hilbert program. Section 5 is devoted to the development of an informal' technique in the theory of computability often called ‘argument by Church's thesis’.     

Remarks on the Theory of Quasi-sets

Quasi-set theory has been proposed as a means of handling collections of indiscernible objects. Although the most direct application of the theory is quantum physics, it can be seen per se as a non-classical logic (a non-reflexive logic). In this paper we revise and correct some aspects of quasi-set theory as presented in [12], so as to avoid some misunderstandings and possible misinterpretations about the results achieved by the theory. Some further ideas with regard to quantum field theory are also advanced in this paper.     

Remarks on the Geometry of Visibles

I offer an explication of Reid's claim (discussed recently by Yaffe and others) that the geometry of the visual field is spherical geometry. I show that the sphere is the only surface whose geometry coincides, in a certain strong sense, with the geometry of visibles.