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)

Branching time is a popular theory of time that is intended to account for the openness of the future. Generally, branching-time models the openness of the future by positing a multiplicity of concrete alternative futures mirroring all the possible ways the future could unfold. A distinction is drawn in the literature among branching-time theories: those that make use of moment-based structures and those that employ history-based ones. In this paper, I introduce and discuss a particular kind of openness relative to (...) the possibility that time ends (doomsday). I then show that whereas moment-based branching structures cannot represent this kind of openness, history-based structures can account for it. The conclusion is that history-based structures have an advantage over moment-based ones. (shrink)