Franz Berto

“There’s Plenty of Room at the Bottom”, said the title of Richard Feynman’s 1959 seminal conference at the California Institute of Technology. Fifty years on, nanotechnologies have led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models—one still largely missing is reversibility. The dynamic laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final states. On the other hand, as von Neumann already conjectured, irreversible information processing is expensive: to erase a single bit of information costs ~3 × 10−21 joules at room temperature. Information entropy is a thermodynamic cost, to be paid in non-computational energy dissipation. This paper addresses the problem drawing on Edward Fredkin’s Finite Nature hypothesis: the ultimate nature of the universe is discrete and finite, satisfying the axioms of classical, atomistic mereology. The chosen model is a cellular automaton with reversible dynamics, capable of retaining memory of the information present at the beginning of the universe. Such a CA can implement the Boolean logical operations and the other building bricks of computation: it can develop and host all-purpose computers. The model is a candidate for the realization of computational systems, capable of exploiting the resources of the physical world in an efficient way, for they can host logical circuits with negligible internal energy dissipation.

I present an approach to our conceiving absolute impossibilities—things which obtain at no possible world—in terms of ceteris paribus intentional operators: variably restricted quantifiers on possible and impossible worlds based on world similarity. The explicit content of a representation plays a role similar in some respects to the one of a ceteris paribus conditional antecedent. I discuss how such operators invalidate logical closure for conceivability, and how similarity works when impossible worlds are around. Unlike what happens with ceteris paribus counterfactual conditionals, the closest worlds are relevantly closest belief-worlds: closest to how things are believed to be, rather than to how they are. Also, closeness takes into account apriority and the opacity of intentional contexts.

Accounts of propositions as sets of possible worlds have been criticized for conflating distinct impossible propositions. In response to this problem, some have proposed to introduce impossible worlds to represent distinct impossibilities, endorsing the thesis that impossible worlds must be of the same kind; this has been called the parity thesis. I show that this thesis faces problems, and propose a hybrid account which rejects it: possible worlds are taken as concrete Lewisian worlds, and impossibilities are represented as set-theoretic constructions out of them. This hybrid account (1) distinguishes many intuitively distinct impossible propositions; (2) identifies impossible propositions with extensional constructions; (3) avoids resorting to primitive modality, at least so far as Lewisian modal realism does.