Presenting material in a more object-oriented way is a growing trend in Computer Science education. This paper takes the idea of objects-first or abstraction-first teaching a step further, by using Bloom’s Taxonomy to design a course in such a way as to present factual content early, followed by higherlevel cognitive skills. In the course described here, factual content was covered rapidly, the...

It is an open question whether we ever successfully explain earlier states by appealing to later ones, and, further, whether this is even possible. Typically, these two questions are answered in the same way: if we give and accept ‘backward explanations,’ they must be possible; if they are impossible, we are right to reject them. I argue that backwards explanations are brittle—they fail if the ...

Abstract Whereas many philosophers take backwards causation to be impossible, the few who maintain its possibility either it absent from actual world or else confined theoretical physics. Here, however, I argue that is not only actual, but common, though occurring in context of our social institutions. After juxtaposing my cases with a others literature and arguing we should seriously reality c...

Proof: (by induction). We want to show that one SAP doesn’t introduce negative cycles in Gf . Initially there are no negative cost cycles. Feasible prices can be computed by using shortest path distances from s. After finding the shortest s-t path, it has reduced cost 0. Every arc on the path has reduced length 0. This demonstrates that the triangle inequality property is tight on shortest path...

We propose a dependently typed formalization for a simple class of sequential decision problems. For this class of problems, we implement a generic version of Bellman’s backwards induction algorithm [2] and a machine checkable proof that the proposed implementation is correct. The formalization is generic. It is presented in Idris, but it can be easily translated to other dependently-typed prog...