In philosophical logic and metaphysics there is a long-standing debate around the most appropriate structures to represent indeterministic scenarios concerning the future. We reconstruct here such a debate in a computational setting, focusing on the fundamental difference between moment-based and history-based structures. Our presentation is centered around two versions of an indeterministic scenario in which a programmer wants a machine to perform a given task at some point after a specified time. One of the two versions includes an assumption about (...) the future behaviour of the machine that cannot be encoded in any programming instruction; such version has models over history-based structures but no model over a moment-based structure. Therefore, our work adds a new stance to the debate: moment-based structures can be said to rule out certain indeterministic scenarios that are computationally unfeasible. (shrink)

The future is different from the past. What is past is fixed and set in stone. The future, on the other hand, is open insofar as it holds numerous possibilities. Branching-tree models of time account for this asymmetry by positing an ontological difference between the past and the future. Given a time t, a unique unified past lies behind t, whereas multiple alternative existing futures lie ahead of t. My goal in this paper is to show that there is an (...) incompatibility between the way branching-tree models account for the open future and the possibility of time travel. That is, I argue that once time travel enters the picture, branching time fails to model the openness of the future by means of alternative future branches. I show how this holds independently of whether branching-time models are cashed out in A-theoretic or B-theoretic terms. (shrink)