Causal Reasoning and Meno’s Paradox

Causal reasoning is an aspect of learning, reasoning, and decision-making that involves the cognitive ability to discover relationships between causal relata, learn and understand these causal relationships, and make use of this causal knowledge in prediction, explanation, decision-making, and reasoning in terms of counterfactuals. Can we fully automate causal reasoning? One might feel inclined, on the basis of certain groundbreaking advances in causal epistemology, to reply in the affirmative. The aim of this paper is to demonstrate that one still has good skeptical grounds for resisting any conclusions in favour of the automation of causal reasoning. If by causal reasoning is meant the entirety of the process through which we discover causal relationships and make use of this knowledge in prediction, explanation, decision-making, and reasoning in terms of counterfactuals, then one relies besides on tacit knowledge, as might be constituted by or derived from the epistemic faculty virtues and abilities of the causal reasoner, the value systems and character traits of the causal reasoner, the implicit knowledge base available to the causal reasoner, and the habits that sustain our causal reasoning practices. While certain aspects of causal reasoning may be axiomatized and formalized and algorithms may be implemented to approximate causal reasoning, one has to remain skeptical about whether causal reasoning may be fully automated. This demonstration will involve an engagement with Meno’s Paradox.


Introduction
Are we in a position to fully automate causal reasoning? Given recent groundbreaking advances in causal epistemology, one might be tempted to reply in the affirmative. In this paper, it will be demonstrated how, notwithstanding a number of significant philosophical and computational developments, one still has good skeptical grounds for resisting any conclusions in favour of the automation of causal reasoning. Our critical examination of the central opening question (hereafter: the automation question) will rely on a delineation of these philosophical and computational advances in causal epistemology, a careful articulation of the automation question, Meno's Paradox and Polanyi's treatment of it, and an application of Polanyi's insights about the nature of tacit knowledge to the automation question.

Main discussion: philosophical advances in causal epistemology
Before we commence our critical examination of the automation question, an acknowledgment of the state-of-the-art in causal epistemology will first be in order. 1 After all, one could argue that certain philosophical and computational developments have made it plausible (or at least more plausible than hitherto has been the case) to answer the automation question in the affirmative. In the first half of the twentieth 1 The metaphysics of causation is concerned with the intrinsic nature of causal relationships and causal relata. Causal epistemology, on the other hand, is concerned with how certain methods might be developed from assumptions and operationalized into procedures that enable us to successfully and reliably acquire causal knowledge, learn about causality, make causal inferences, and provide justification for these causal inferences. For the more formally inclined, a lot of the relevant logical and computational notation will be provided in the succeeding footnotes. Nothing will be lost argumentatively, if these footnotes are glossed over in a more general attempt to understand how a skeptical response to the automation question might be motivated. century, regularity theory was the dominant philosophical approach to causal epistemology. According to the regularity camp, we infer the existence of type-level causal relationships from identified regularities in sequences of event types (Hume 1748;Mill 1843). For example, we infer that C causes E if every event of type C is routinely followed by an event of type E. 2 Naïve regularity theorists traditionally maintain that C causes E if certain Humean criteria (viz. temporal succession, spatiotemporal contiguity, necessary connection) are satisfied. However, these criteria may not be sufficient for relationships to count as causal in nature. Even though day regularly follows the night, both relata are contiguous, and there is the idea of a necessary connection between day and night, day does not cause the night (Reid 1785). Likewise, even though umbrella vendors are always around before it starts raining, we do not conclude that the presence of umbrella vendors causes rain (Kleinberg 2013).
In other instances, these criteria may be unnecessary. 3 Even more sophisticated regularity theorists face the problem of distinguishing between type-level causation (i.e. regular occurrences at population level) and token-level causation (i.e. the occurrence of an effect in a particular scenario). Philosophical advances in the second half of the twentieth century led to the development of the counterfactual and probabilistic approaches to causation and extended our understanding of how we make causal inferences, learn about causality, and acquire causal knowledge. According to the counterfactual camp, we can infer the existence of token-level causal relationships from the use of counterfactual conditionals and possible world semantics (Stalnaker 1968;Lewis 1973). For example, one might learn from the regularity camp that C causes E, since a material implication relation exists at type-level between C and E. When reasoning about a possible world that is sufficiently similar to the actual world in which 'C → E' is true, one might conclude that if the event-token c had not occurred, then the eventtoken e would not have occurred. 4 According to the probabilistic camp, both the regularity and counterfactual camps erroneously hold that causes produce their effects without fail at type-or token-level. 5 Rather, the causal relationship between variables is probabilistic rather than deterministic in nature: C is a positive cause of E if the probability of E occurring is still (positively) altered by C, after common causes or confounders have been conditioned on (Reichenbach 1956;Suppes 1970;Eells 1991). 6 It should be noted that these philosophical advances have since been superseded by certain computational advances in the field of computer science and AI research (Pearl 2000;Kleinberg 2013). Nonetheless, while computational methods may or may not be philosophically informed, they tend to rely on certain philosophical assumptions as axioms for developing causal models of reality. 4 Formally: ~ c □→ ~ e. Following the analysis of the truth-conditions of counterfactual conditionals in terms of possible world semantics and causation in terms of counterfactual dependence, we infer that c causes e. 5 Even after the causes have been fully specified and we possess perfect information about the world, we still cannot take it for granted that causes will produce their effects without fail. 6 Formally: P(E|C) > P(E|~ C).
According to the Common Cause Principle, C is causally relevant to E iff (i) C temporally precedes E; (ii) P(E|C) > P(E); and (iii) there does not exist a set of events S such that C and E are uncorrelated, conditional upon S (i.e. S 'screens off' C from E) (Reichenbach 1956).
According to the two-step approach of Suppes (1970): Step 1: Step 2: X t ′ is a prima facie but ε-spurious cause of Y t iff ∃t'' < t' and Z t ′′ such that: According to the more sophisticated probabilistic approach of Eells (1991), which takes into account the background contexts or knowledge bases (viz.K i ): At type level and for each i: (i) C is a positive causal factor of E iff P(E|K i ∧ C) > P(E|K i ∧ ∼C); (ii) C is a negative causal factor of E iff P(E|K i ∧ C) < P(E|K i ∧ ∼C); (iii) C is a neutral causal factor of E iff P(E|K i ∧ C) = P(E| K i ∧ ∼C ); or.
(iv) Otherwise, C is a mixed causal factor of E. At token level: , where ADCS (E, C) is the average degree of causal significance of C for E.
2 Formally: C → E. According to the naïve regularity theorist, C causes E if every event of type C is followed by an event of type E. More sophisticated regularity theorists are keener on describing causal relationships in terms of necessity and sufficiency. According to these theorists, C causes E if C is at least an INUS (viz. insufficient but non-redundant part of an unnecessary but sufficient) condition of E (Mackie 1965; see also Rothman 1976).

Main discussion: key philosophical assumptions
A key philosophical assumption that has emerged from these philosophical approaches to causation is the No Backwards Causation assumption. According to this assumption, causes cannot be temporally preceded by their effects. 7 Another key philosophical assumption is the Alteration of Probabilities assumption, according to which causes alter the probabilities of their effects. Positive causes raise the probability of their effects, whereas negative causes lower the probability of their effects. 8 Without the Alteration of Probabilities assumption, we will not be able to rely on observed statistical correlations as a guide to type-level causal relationships. Last but not least, the Causal Sufficiency assumption is a key philosophical assumption according to which there are no hidden common causes. Alternatively, the set of measured variables must be causally sufficient. By causal sufficiency is meant the following: for any set of variables V, every common cause (relative to V) of any pair of variables in V is also contained in V. Absent the Causal Sufficiency assumption, and hidden common causes (or confounders) can lead to spurious correlations between causally unrelated variables (or confounding bias) and result in erroneous causal inferences. 9 To illustrate the Causal Sufficiency assumption by means of a toy example, let us return to Reid's (1785) day-and-night example ( Fig. 1): We observe a marginal dependence relation between the relata X and Y: day regularly follows the night and vice versa. If we fail to observe the Causal Sufficiency assumption, we end up omitting the common cause or confounder Z from our set of variables. This will result in our incorrectly inferring, on the basis of the marginal dependence relation between X and Y, a causal dependence relation between X and Y. Conversely, if we observe the Causal Sufficiency assumption, no common causes (including Z) will be omitted. The joint effects of Z (viz. X and Y) will no longer erroneously appear to be dependent. In accordance with Reichenbach's (1956) Common Cause Principle (described in fn. 6), X and Y will be conditionally independent, given their common cause Z (formally: X ⊥ Y | Z) (Fig. 1).

Main discussion: computational advances in causal epistemology
The No Backwards Causation, Alteration of Probabilities, and Causal Sufficiency assumptions are central features of the probabilistic camp and undergird the most prominent computational approaches to causal reasoning. Nonetheless, it is important to bear in mind that philosophical and computational advances in causal epistemology are related though distinct. While they might be guided by the theoretical considerations of philosophical approaches to causation, computational approaches are also characterized by a distinct set of concerns: the ability to translate theory into methods, practices, and procedures, the ability to operationalize definitions about causation and causal relationships, the ability to infer causal relationships from data, and the ability to render feasible the degree of computational complexity of the task. 10  Eells (1991). The Alteration of Probabilities assumption is a matter of methodological expediency rather than conceptual necessity, since there are instances in which causal relationships exist, without any change in probability. See Hesslow (1976) for a celebrated example of multiple pathways between causal relata that exactly cancel each other out and Cartwright (1989), Hoover (2001), and Zhang and Spirtes (2008) for further critical discussion. 9 To be certain, there are other philosophical assumptions that are generally made in causal epistemology. Among the assumptions that are made in support of induction in general are the Uniformity of Nature and Ceteris Paribus assumptions. According to the former assumption, the world is structured in a certain orderly way and its underlying causal laws are preserved in an induction-friendly manner. According to the latter assumption, all other things being equal, we are justified in expecting certain patterns between variables in the past to continue into the future. Other assumptions that support causal inference in particular include the Parsimony assumption and the Connection by Mechanism assumption. According to the former assumption, all other things being equal, we are justified in ruling in favour of the most parsimonious causal hypothesis. According to the latter assumption, there must exist a mechanism or set of mechanisms connecting causes to their effects.
10 Some philosophical advances are computationally inclined though ultimately computationally infeasible. Consider the more computationally inclined probabilistic approach of Eells (1991) (see fn. 6): if n variables are under consideration, then there will be 2 n background contexts. Testing for all contexts (viz. K 1 , K 2 , …, K 2 n ) to determine ADCS (E, C) will be a task of considerable computational complexity. For a critical overview of the key differences between the philosophical and computational approaches to causation, see Kleinberg (2013). 7 The Temporal Priority assumption is the assumption according to which causes must temporally precede their effects. This assumption rules out sensu stricto both simultaneous causation (causes being temporally simultaneous with their effects) and backwards causation (causes being temporally preceded by their causes Philosophical advances provide theoretical guidance about how causal relationships may be inferred. In turn, computational methods aim to translate theory into computationally feasible methods, practices, and procedures, operationalize general definitions about causation and causal relationships, and infer causal relationships from data. An early computational advance in the second half of the twentieth century was the Granger Causality approach, which takes two time series, determines whether one time series is useful for forecasting the other, and subsequently uses these determinations as a basis for making causal inferences (Wiener 1956;Granger 1969Granger , 1980. This approach relies on the Temporal Priority assumption (a variant of the No Backwards Causation assumption), the Alteration of Probabilities assumption, and a more method-specific No Redundant Information assumption. 11 While the pragmatically-oriented Granger Causality approach is recognized for its ability to operationalize definitions about causal relationships, incorporation of temporal information, ability to handle continuous variables, and applicability across such diverse fields as finance, neuroscience, and physics, there remains much debate about whether Granger Causality is necessary or sufficient for causality (Cartwright 1989;Hoover 2001).
A more recent computational advance has been the Graphical Model approach, which generates a Directed Acyclic Graph (or DAG) from a set of data (Pearl 2000;Spirtes et al. 2000). 12 These DAGs, also known as Bayesian networks, represent the causal structure of the system under investigation. 13 The Graphical Model approach has been designed to produce one or more graphs to represent the independence relations that are consistent with a given set of data and does not require the incorporation of temporal information, unlike the Granger Causality approach. This approach relies on the Alteration of Probabilities assumption, the Causal Sufficiency assumption, and a couple of other more method-specific axioms. 14 While the Graphical Model approach has enjoyed much popularity, it is arguably less complete than its more recent computational rival: the Probabilistic Temporal Logic approach of Kleinberg (2013Kleinberg ( , 2016. Like the Granger Causality approach, Kleinberg's aim is to develop a computationally feasible method for reliably inferring causal relationships from time series data. Kripke structures represent the causal structure of the system under investigation and the DAGs of the Graphical Model approach can be subsumed under these Kripke structures. 15 Guided by the more computationally inclined philosophical considerations of Eells (1991), Kleinberg has developed an ADCS-inspired measure of causal significance to determine the average difference a cause makes to the probability of its effect. 16 Kleinberg's approach relies on the No Backwards Causation assumption, the Alteration of Probabilities assumption, and the Causal Sufficiency assumption.
Nonetheless, certain issues remain. In the first instance, it has been argued that mechanistically mediated effects are hybrids of causal relationships (i.e. between causes and their effects) and constitutive relationships (i.e. between parts and the whole). Consider the causal claim that myocardial infarction is the cause of death. Death is a mechanistically mediated effect: when the heart stops beating, it stops transporting oxygen and nutrients to other tissues of the body, these tissues stop functioning, and the non-functioning 11 The former assumption is a variant of the No Backwards Causation assumption (see fn. 7). According to the latter assumption, all the knowledge in the universe available at time n (denoted by Ω n ) contains no redundant information. Formally, X Granger-causes Y if P(Y n+1 |Ω n ) ≠ P(Y n+1 |Ω n -X*(n)). 12 While the Graphical Model approach typically draws on the probabilistic theory about causation to make type-level causal inferences from the data, more recent advances have sought the counterfactual camp to cope with token-level causal inferences. See the work of Hopkins and Pearl (2007)  14 The more method-specific axioms or conditions are (variously) the Causal Markov Condition, the Causal Faithfulness Condition, and the Frugality Condition. According to the Causal Markov Condition (or CMC), any variable x in a variable set V is conditionally independent of its non-effects, given its direct causes or parents. According to the Causal Faithfulness Condition (or CFC), if the causal structure does not entail a conditional independence relation according to the CMC, then the conditional independence relation does not hold of the true probability distribution. The CFC implies that any conditional independence relations that have been identified are due to causal structure, rather than coincidence, unmeasured variables, or other factors. According to the Frugality Condition, given a set of causal hypotheses that are compatible with the probability distribution, one ought to choose from among those hypotheses that postulate the lowest number of causal arrows. Compare the Frugality Condition with the Parsimony assumption, as described in fn. 9. 15 More specifically, whereas the DAGs in the Graphical Model approach forbid cycles (hence the titular acyclicity), the probabilistic Kripke structures in the Probabilistic Temporal Logic approach naturally admit cycles. With respect to systems that exhibit repeated or homeostatic behaviour and behavioral feedback loops (e.g. biological systems), the wider expressive capabilities of probabilistic Kripke structures would constitute a distinct advantage. Probabilistic Kripke structures are also called Discrete Time Markov Chains (or DTMCs). 16 Let X denote the set of prima facie causes of e and avg (c, e) denote the significance of cause c for an effect e. Furthermore, let = x (c, e)P(e|c ∧ x) − P(e| ∼c ∧ x) . Formally: avg (c, e) = ∑ x∈X�c x (c,e) �X�c� . constitutes the death of that individual (Craver and Bechtel 2007). Where causal reasoning in certain domains (e.g. neurobiology, molecular biology) typically necessitates an appeal to mechanisms, the details of scientific practice, and a multi-level character of explanations (both causal and constitutive), skepticism remains about whether our best-going computational models can capture and automate causal reasoning in these domains (Machamer et al. 2000). In the second instance, there is an ongoing debate about whether mental properties can in principle function as efficacious causes of both physical and mental properties. This is a debate about the validity and soundness of causal exclusion arguments, which typically conclude that mental properties supervening on physical properties cannot cause physical or other mental properties (Kim 2003). In addition, if mental properties count as causally efficacious, can the causal efficacy of these mental properties be accounted for on empirical grounds? We still lack a complete understanding of whether and how mental states (e.g. beliefs, thoughts, intentions, etc.) causally interact with one another and with physical states. Where causal explanation in certain domains (e.g. law, the social sciences) appeals to reasons, motives, intentions, desires, and beliefs, skepticism likewise remains about whether causal reasoning can be fully automated in these domains (Knobe 2009). The mechanistic and mental aspects of causal reasoning have not yet been successfully automated, and it is unclear whether they can be subsumed under the best-going computational models. 17 In the third instance, consider various dilemmas that arise in causal reasoning. Does the chicken cause the egg or does the egg cause the chicken? This dilemma is at least as old as Aristotle and may be structured as an infinite regression in causal reasoning. The causal relationship between the chicken and the egg is considered a strange loop in direct relation to Godël's incompleteness theorem (Hofstadter 1999). In the context of complete causal self-referencing, it is Turing-incomputable insofar that the actual cause is undecidable (Kampis 1995). This chicken-and-egg-type dilemma cannot be resolved by a definite procedure. One may perform a root-cause analysis (or RCA), uncovering the underlying biological mechanisms when determining whether it is the chicken or the egg that is causally prior. However, the complex and non-linear nature of relationships over an evolutionary time-scale fosters enormous difficulties with respect to an RCA approach. 18 Retrodiction of the initial causes of complex and non-linear systems is impossible due to the intrinsic chaos and complexity of the systems in question (Li and Yorke 1975).
In the fourth instance, the best-going computational models aim to tell us what it is for something to count as a cause or how we can learn of causal relationships through datasets. However, computational models and methods may not be appropriate for all cases. As has been conceded by Kleinberg (2013), all theories of and methods for inferring causality-including Kleinberg's own method-fail to handle at least some scenarios, potential challenges, and counterexamples. The lack of a unified solution has lent weight to philosophical arguments in favour of causal pluralism (Anscombe 1971;Cartwright 2007). If causal pluralism is correct, then there may be several different ways to learn about causal relationships and several methods, each of which may be suitable for different situations. In these (viz. the multi-level character of explanations, the causal efficacy of mental properties, chicken-and-egg-type dilemmas of causal reasoning, the complexity of systems, causal pluralism) and other instances, we maintain that causal reasoning cannot be fully automated and remain skeptical about the existence of a general and universal program capable of causal reasoning in a fully automated sense.

Main discussion: the automation question
Given these philosophical and computational advances in the second half of the twentieth and first decades of the twenty-first century, we might have good reason to believe that it has become plausible for us to answer the automation question in the affirmative. After all, might we not have good reason to expect further philosophical and computational advances to be made in the remainder of the twenty-first century, advances that could well deliver the hoped-for outcome of fully automated causal reasoning?
One might raise the caveat that handling real-world data is challenging: there might be biases, errors, or noise in the data, there is the ever-growing computational complexity of analyzing multidimensional data to be reckoned with, there could be gaps in the recording of the relevant variables, certain variables might be missing, and our knowledge could still remain incomplete. Suppose for the sake of argument that we encounter no problems with our data. Suppose further that we have in place a sufficiently advanced computational method that is guided by the state-of-the-art in philosophical theory and will allow us to infer causal relationships relative to this set of problem-free data. Are we therefore in a position to fully automate causal reasoning? 19

Main discussion: Meno's Paradox
To address the automation question, we must proceed by way of a paradox, first introduced in a dialogue by Plato, and a response offered to this paradox by Michael Polanyi. Consider the following argument, adapted from Plato's Meno (n.d.,: P1: For any p, either one knows that p or one does not know that p.
P2: If one knows that p, then inquiry about p is unnecessary.
P3: If one does not know that p, then inquiry about p is impossible.
C: Therefore, for any p, inquiry about p is either unnecessary or impossible. 20 This argument is known as Meno's Paradox. Plato's resolution of this paradox involves the invocation of a theory of recollection. According to Plato's theory of recollection, we begin neither in a state of complete knowledge about p nor in a state of complete ignorance about p. We come to know more about p by recollecting something that was learnt about p in a previous life. 21 There is much controversy surrounding Plato's resolution of Meno's Paradox via a theory of recollection (or the discovery of innate ideas). While the problem posed by Meno's Paradox is an acute one, potentially throwing into question all inquiry as absurd (i.e. either unnecessary or impossible), an alternative response is required if Plato's theory of recollection proves to be unsatisfactory. Polanyi's (1966) response is that if all knowledge is explicit (i.e. capable of being clearly stated in the propositional form p), then either inquiry is unnecessary (i.e. you know what you are searching for) or impossible (i.e. you do not know what you are searching for). In other words, if all knowledge is explicit, then Meno's Paradox stands. However, if at least some knowledge is tacit (i.e. non-explicit), then we come to know more about something by relying on tacit knowledge. 22 Tacit knowledge, in turn, consists in the 'intimation of something hidden, that we may yet discover' (Polanyi 1966, pp 22-3). Given the fact that problems exist and discoveries (causal, scientific, etc.) can be made by solving these problems, the search for knowledge is clearly not absurd. The implication, if one accepts Polanyi's (1966) response to Meno's Paradox, is therefore that tacit knowledge exists: we can know things that we cannot yet tell.
One could raise the objection that the connection between the automation question and Meno's Paradox is tenuous and unconvincing at best, insofar that the trade-off between implicit and explicit knowledge has typically been a topic of much AI research. How might causal reasoning be uniquely hampered by this particular trade-off? 23 In response to this objection, we must first distinguish between the nature of causation (ontic) and the nature of our knowledge about causation (epistemic). What Polanyi's resolution of Meno's Paradox suggests is that inquiry into the nature of both causation and our knowledge about causation is neither unnecessary nor impossible, since the original dilemma is false. The nature of causation is neither fully known nor fully unknown. We have at least some knowledge about certain aspects of the ontology of causation (e.g. causal relata may be characterized in terms of events, objects, processes, states of affairs, etc.) and the formal properties of causal relationships (e.g. transitivity, asymmetry, etc.). Likewise, the nature of our knowledge about causation is neither fully known nor fully unknown. We have some tacit knowledge of the nature of our knowledge about causation, which could be made explicit in the process of rational inquiry. We may even come to formalize and axiomatize certain salient aspects of causal reasoning. However, the nature of both causation and our knowledge about causation continues to remain contested. Where this contestation remains, we must conclude that we can know things that we cannot yet tell. Until the contested nature of both causation and our knowledge about it has been removed, our response to the automation question must remain a skeptical one. Last but not least, consider the paradox of self-reference that arises with respect to such statements as 'This sentence is false' and 'All Cretans are liars' (uttered by a Cretan). The ability to resolve paradoxes and decipher statements of this nature involves inter alia an ability to discern the implicit and explicit knowledge that 20 Formally: P1: P ⊻ ~ P (where '⊻' is the logical symbol for exclusive disjunction).
This argument is logically valid. 21 Plato's theory of recollection is a controversial one, and its proof involves Socrates successfully eliciting the correct response to a geometrical problem from an uneducated slave through the posing of certain leading questions. 22 The distinction between explicit knowledge and tacit knowledge may be usefully compared with the German distinction between wissen and können and the Rylean distinction between knowing-that and knowing-how (Polanyi 1966, pp 6-7). One could also introduce Russell's (1910) distinction between knowledge by description and knowledge by acquaintance. 23 We are again grateful to Judea Pearl for raising this particular objection.
Footnote 19 (continued) ing programs, that tend to be useful and even amplify the intellect of the theoretician), the latter may well be impossible on grounds that we will proceed to discuss in our investigation of Meno's Paradox. The objection that causal reasoning is already automated (at least to some extent in certain domains) is therefore not one that applies to our position. We are grateful to George Kampis for this comment.
is contained within these paradoxes and linguistic tricks. Before a response to the automation question can even be attempted, we must first understand the cognitive processes and causal reasoning procedures that bring about this discernment (Hofstadter 1999). While our understanding of these processes and procedures remains incomplete, we have further reasons to maintain a healthy skepticism when responding to the automation question.

Main discussion: tacit knowledge
In the context of causal epistemology, any philosophical and computational advances (e.g. in assumptions, general or operational definitions for causal relationships, supporting formal notation, axioms, equations, graphical representations, or data) pertain to the domain of explicit knowledge. Causal reasoning is not exhausted by the explicit knowledge that can be secured by the most robust and appropriate assumptions, philosophical theories, computational methods, and data. Rather, causal reasoning relies on the use of at least some tacit knowledge.
This tacit knowledge is in turn constituted by or derived from the following: (A) The epistemic faculty virtues and abilities of the causal reasoner: a Reliable perception; b Reliable memory; c Observation skills; d Procedural knowledge of and competence in how to skillfully conduct experiments, undertake statistical analysis, and imagine counterfactually; e Procedural knowledge of and competence in how to carry out critical evaluation, with a view to developing better theories, methods, and approaches 24 ; (B) The value systems and character traits of the causal reasoner 25 : C The implicit knowledge base available to the causal reasoner: a Implicit background knowledge of experts (e.g. knowledge about possible mechanisms); D The habits that sustain our causal reasoning practices: a Heuristics and other cognitive shortcuts developed from experience; b Epistemic practices (e.g. deferring to and trusting epistemic superiors and peer review processes).
If at least some knowledge is tacit in nature and if not all of this tacit knowledge can ultimately be reduced to explicit knowledge, then we must recognize the tacit dimension in causal reasoning. 27 This tacit knowledge allows us inter alia to make certain refinements and further determinations (e.g. the relevant domain of application, the level of sophistication required, Kleinberg's ε-value threshold as discussed in fn. 16, etc.) within each philosophical theory and computational method, critically evaluate competing theories and methods, recognize certain variables as genuine causes despite the violation of certain axioms, assumptions, and other related parameters, and potentially discover and develop new and alternative theories and methods.
An implication of this is that the idea that causal reasoning can be fully automated rests on a mereological mistake. What AI systems are capable of performing on the causal reasoning front is complex information processing, which is a part of causal reasoning but not the whole of it. 28 To assert that causal reasoning can be fully automated is to mistake the part (complex information processing) for the whole (causal reasoning, which presupposes in addition the skills, abilities, faculties, value systems, character traits, and cultural habits that give rise to tacit knowledge). At the same time, one could offer the following olive branch to AI researchers: what is denied is the possibility of full automation rather than that of partial automation (see fn. 19 for the distinction). The commonplace ex nihilo nihil sunt, first defended by Parmenides and later installed as a dictum in the AI research tradition, tells us that we get nothing from nothing. While not all assumptions can be made explicit in causal reasoning, that is also true for other domains in which AI has been applied. One must assume something 24 See the related work of Sosa (1985) and Greco (1993Greco ( , 2009) in virtue epistemology. 25 One often easily forgets how one's reasoning about causes and their effects is value-laden and interest-driven. Values and interests determine the domains of interest, the range of what counts as causally relevant, and the grade of priority to be given to each problem in the use of intellectual and computational resources. Polanyi (1969) refers to the last-mentioned of these determinations as the 'strategic intuition'. a The goals, ends, values, interests, and purposes (ends) toward which causal reasoning (means) is directed; b Epistemic trait virtues and virtuous motivations (e.g. love of truth, avoidance of error, conscientiousness, open-mindedness, intellectual humility) 26 ; 26 See the related work of Zagzebski (2003) and Battaly (2008) in virtue epistemology. 27 This is ultimately Polanyi's position: the process of formalizing all knowledge to the exclusion of any tacit knowledge is a self-defeating one. See Sen (2009). 28 It should not therefore surprise us that at least some of the AI pioneers (viz. Newell and Simon) disliked the phrase 'AI' malgré eux and preferred the term 'complex information processing'. See Nilsson (2010, pp 53-4). Perhaps the time has come for us to call a spade a spade and revive the usage of the term 'complex information processing'. from the outset to get a formal theory. However, once that assumption is in place, partial automation may be possible relative to our assumptions (both stated and implicit). Causal reasoning may not be that radically different after all from other AI-relevant domains, and one is reminded that while a part of the whole can be automated, the whole itself (e.g. causal reasoning in its broadest and most representative sense) cannot be. 29 Finally, it is known according to the Church-Turing thesis that there exist uncomputable functions and uncomputable real numbers that cannot be computed by any algorithm. This constitutes a fundamental mathematical constraint on the issue of full automation.
To gain an understanding about the nature of this mereological mistake is to attain wisdom about causal reasoning, where wisdom is a higher rung on the epistemic hierarchy than (in descending order) knowledge, reasoning, data, and information. 30

Conclusion
To conclude, if by an algorithm for causal reasoning is meant a finite procedure, explicitly stated in pseudo-or actual code, through which causal reasoning is replicated, then an affirmative response to the automation question implies the existence (actual or possible) of such an algorithm. 31 Such an algorithm might be constructed on the basis of the state-of-the-art theoretical frameworks in philosophy, computational methods in econometrics and computer science, and the data relative to which causal relationships might be inferred. The most sophisticated algorithm would, however, remain strictly in the domain of explicit knowledge.
Given the nature of Meno's Paradox and the possibility of scientific discovery (causal, scientific, etc.), one plausible philosophical response has been to invoke a distinction between tacit and explicit knowledge. If by causal reasoning is meant the entirety of the process through which we discover causal relationships between variables and make use of this knowledge in prediction, explanation, decisionmaking, and reasoning in terms of counterfactuals, then we have good grounds for maintaining that we do not merely rely on explicit knowledge (i.e. knowledge that is capable of being clearly stated in the propositional form). In addition, we rely on tacit knowledge, as might be constituted by or derived from the epistemic faculty virtues and abilities of the causal reasoner, the value systems and character traits of the causal reasoner, the implicit knowledge base available to the causal reasoner, and the habits that sustain our causal reasoning practices.
If the foregoing analysis is correct, then the answer to the automation question must be a resounding 'no'. If the foregoing analysis is correct, then any implementation of algorithms that approximate causal reasoning ought to be corroborated where possible with other methods (e.g. the use of background knowledge, the reliance on domain experts, the undertaking of experimental studies and RCTs, etc.), given the probabilistic and defeasible nature of causal reasoning. If the foregoing analysis is correct, then in the event of confusion and uncertainty (e.g. when dealing with complex cases), any final appeal should be made to our traditional storehouses of tacit knowledge, the domain experts themselves.