1. Prolegomena. Provlēmata gnōsiologias.

It is an experimental fact that \ -decays produce in a cloud chamber at most one track and that this track points in a random direction. This seems to contradict the description of decay in Quantum Mechanics: according to Gamow a spherical wave is produced and moves radially according to Schrödinger’s equation. It is as if the interaction with the supersaturated vapor turned the wave into a particle. The aim of this note is to place this effect in the context (...) of Schrödinger’s Quantum Mechanics. We shall see that the properties of the initial wave function suggest the introduction of a semiclassical formalism in which the \ -wave can be described as a collection of semiclassical wavelets; each of them interacts with an atom and forms an entangled state. The interaction can be regarded as a semiclassical inelastic scattering event. The measurement selects the wave function of one of the ions, with a probability given by Born’s rule. This ion interacts with the atoms nearby leading to the formation of a droplet. One can reasonably assume that also the wavelet entangled with the selected ion has probability one to remain as part of the description of the system. The measurement process is therefore represented by a unitary operator. The wavelet remains sharply localized on a classical path \ It is still a probability wave: it determines the probability that another atom be ionized. This probability is essentially zero unless the atom lies on \ . This gives the visible track. (shrink)

Interactive theories of lexical retrieval in language production assume that activation cascades from earlier to later processing levels, and feeds back in the reverse direction. This commentary invites Pickering & Garrod (P&G) to consider whether cascading and feedback can be seen as a form of forwarding modeling within a hierarchical production system.

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation (...) of the natural numbers). We observe, e.g., that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non‐periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non‐commutative and non‐Boolean c.e. ring. (shrink)