The generality problem is one of the most pressing challenges for reliabilism. The problem begins with this question: of all the process types exemplified by a given process token, which types are the relevant ones for determining whether the resultant belief counts as knowledge? As philosophers like Earl Conee and Richard Feldman have argued, extant responses to the generality problem have failed, and it looks as if no solution is forthcoming. In this paper, I present a new response to the (...) generality problem that illuminates the nature of knowledge-enabling reliability. My response builds upon the insights of Juan Comesaña’s well-founded solution to the generality problem, according to which relevant types are content–evidence pairs, i.e., descriptions of both the target belief’s content and the evidence on which the belief was based. While most responses to the generality problem, including Comesaña’s, only posit one relevant type for any given process token, I argue that knowledge-enabling reliability requires a process token to be reliable with respect to multiple content–evidence pairs, each with varying degrees of descriptive specificity. I call this solution multi-type evidential reliabilism. After offering a clear formulation of MTE, I conclude by arguing that MTE is sufficiently informative to rebut Conee and Feldman’s generality problem objection to a reliability condition on knowledge. (shrink)

The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a path between the two horns (...) of the dilemma by buttressing the counterfactual account with extra conditions intended to block certain classes of deterministic physical systems from qualifying as physical computers. His theory is called the ‘algorithm execution account’. Here we show that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary. We suggest, partly on this basis, that the counterfactual account should be accepted as it stands, pancomputationalist warts and all. (shrink)

Proper functionalism explicates epistemic warrant in terms of the function and normal functioning of the belief-forming process. There are two standard substantive views of the sources of functions in the literature in epistemology: God (intelligent design) or Mother Nature (evolution by natural selection). Both appear to confront the Swampman objection: couldn’t there be a mind with warranted beliefs neither designed by God nor the product of evolution by natural selection? Is there another substantive view that avoids the Swampman objection? There (...) are two. The first is the generalized selected-effects theory of functions. The second is the organizational theory of functions. Both, however, require some history to assign functions, for both are etiological theories of functions: past effects help explain current function. Swampman can then acquire functions, perhaps soon after creation, though he has none at the moment of inception. (shrink)