According to the conventional wisdom, Turing said that computing machines can be intelligent. I don't believe it. I think that what Turing really said was that computing machines –- computers limited to computing –- can only fake intelligence. If we want computers to become genuinelyintelligent, we will have to give them enough “initiative” to do more than compute. In this paper, I want to try to develop this idea. I want to explain how giving computers more ``initiative'' can allow them (...) to do more than compute. And I want to say why I believe that they will have to go beyond computation before they can become genuinely intelligent. (shrink)

Discussion of Searle's case against strong AI has usually focused upon his Chinese Room thought-experiment. In this paper, however, I expound and then try to refute what I call his abstract argument against strong AI, an argument which turns upon quite general considerations concerning programs, syntax, and semantics, and which seems not to depend on intuitions about the Chinese Room. I claim that this argument fails, since it assumes one particular account of what a program is. I suggest an alternative (...) account which, however, cannot play a role in a Searle-type argument, and argue that Searle gives no good reason for favoring his account, which allows the abstract argument to work, over the alternative, which doesn't. This response to Searle's abstract argument also, incidentally, enables the Robot Reply to the Chinese Room to defend itself against objections Searle makes to it. (shrink)

This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...) Turing, was not a computable sequence (i.e., one that could be generated by a Turing machine). Since computers only contained a finite number of instructions (or programs), one might argue, they could not reproduce human intelligence. Turing called this the “mathematical
objection” to his view that machines can think. Logico-mathematical reasons, stemming from his own work, helped to convince Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. He felt it
should be possible to program a computer so that it could learn or discover new rules, overcoming the limitations imposed by the incompleteness and undecidability results in the same way that human
mathematicians presumably do. (shrink)

In his PhD thesis (1938) Turing introduced what he described as 'a new kind of machine'. He called these 'O-machines'. The present paper employs Turing's concept against a number of currently fashionable positions in the philosophy of mind.

I propose to consider the question, "Can machines think?" This should begin with definitions of the meaning of the terms "machine" and "think." The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words "machine" and "think" are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to (...) the question, "Can machines think?" is to be sought in a statistical survey such as a Gallup poll. But this is absurd. Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words. The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B. We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?". (shrink)

I advocate a theory of syntactic semantics as a way of understanding how computers can think (and how the Chinese-Room-Argument objection to the Turing Test can be overcome): (1) Semantics, considered as the study of relations between symbols and meanings, can be turned into syntax – a study of relations among symbols (including meanings) – and hence syntax (i.e., symbol manipulation) can suffice for the semantical enterprise (contra Searle). (2) Semantics, considered as the process of understanding one domain (by modeling (...) it) in terms of another, can be viewed recursively: The base case of semantic understanding –understanding a domain in terms of itself – is syntactic understanding. (3) An internal (or narrow ), first-person point of view makes an external (or wide ), third-person point of view otiose for purposes of understanding cognition. (shrink)

This paper considers undecidability in the imitation game, the so-called Turing Test. In the Turing Test, a human, a machine, and an interrogator are the players of the game. In our model of the Turing Test, the machine and the interrogator are formalized as Turing machines, allowing us to derive several impossibility results concerning the capabilities of the interrogator. The key issue is that the validity of the Turing test is not attributed to the capability of human or machine, but (...) rather to the capability of the interrogator. In particular, it is shown that no Turing machine can be a perfect interrogator. We also discuss meta-imitation game and imitation game with analog interfaces where both the imitator and the interrogator are mimicked by continuous dynamical systems. (shrink)

The main factor of intelligence is defined as the ability tocomprehend, formalising this ability with the help of new constructsbased on descriptional complexity. The result is a comprehension test,or C- test, which is exclusively defined in computational terms. Due toits absolute and non-anthropomorphic character, it is equally applicableto both humans and non-humans. Moreover, it correlates with classicalpsychometric tests, thus establishing the first firm connection betweeninformation theoretical notions and traditional IQ tests. The TuringTest is compared with the C- test and the (...) combination of the two isquestioned. In consequence, the idea of using the Turing Test as apractical test of intelligence should be surpassed, and substituted bycomputational and factorial tests of different cognitive abilities, amuch more useful approach for artificial intelligence progress and formany other intriguing questions that present themselves beyond theTuring Test. (shrink)

Turing''s test has been much misunderstood. Recently unpublished material by Turing casts fresh light on his thinking and dispels a number of philosophical myths concerning the Turing test. Properly understood, the Turing test withstands objections that are popularly believed to be fatal.

A comprehensive introduction to the Language of Though Hypothesis (LOTH) accessible to general audiences. LOTH is an empirical thesis about thought and thinking. For their explication, it postulates a physically realized system of representations that have a combinatorial syntax (and semantics) such that operations on representations are causally sensitive only to the syntactic properties of representations. According to LOTH, thought is, roughly, the tokening of a representation that has a syntactic (constituent) structure with an appropriate semantics. Thinking thus consists in (...) syntactic operations defined over representations. Most of the arguments for LOTH derive their strength from their ability to explain certain empirical phenomena like productivity, systematicity of thought and thinking. (shrink)

The paper argues against a commitment to metaphysical necessity, semantic modalities are enough. The best approaches to elucidate the semantic modalities are (still) versions of lingustic ersatzism and fictionalism, even if only developed in parts. Within these necessary properties and the difference between natural and semantic laws can be accounted for. The proper background theory for this is an updated version of Logical Empiricism, which is congenial to recent trends in Structural Realism. The anti-metaphysical attitude of Logical Empiricism deserves revitalization. (...) Another target besides metaphysical necessity are substantial forms of iterated modalities, as used, for instance, in the philosophy of religion. (shrink)

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...) ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr’s three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the moral tractability thesis. (shrink)

In Philosophy and Technology 36, David Watson discusses the epistemological and metaphysical implications of unsupervised machine learning (ML) algorithms. Watson is sympathetic to the epistemological comparison of unsupervised clustering, abstraction and generative algorithms to human cognition and sceptical about ML’s mechanisms having ontological implications. His epistemological commitments are that we learn to identify “natural kinds through clustering algorithms”, “essential properties via abstraction algorithms”, and “unrealized possibilities via generative models” “or something very much like them.” The same issue contains a commentary (...) on Watson’s paper in which Tom Sterkenburg fiercely opposes the epistemological claim that clustering algorithms can identify natural kinds. Sterkenburg argues there’s nothing about clustering arguments themselves that enables natural kind identification. What’s at stake in the Watson-Sterkenburg debate is whether it is possible for clustering algorithms to identify natural kinds and whether they underly human identification of natural kinds. My contribution to the Watson-Sterkenburg debate is twofold. First, I argue Sterkenburg’s criticism of Watson’s claim is too severe because it denies any clustering algorithm to identify any natural kind. Secondly, I argue Watson’s reply overestimates both clustering algorithms’ and humans’ access to natural kinds and his claim has to be restricted accordingly to ‘We identify kinds via clustering algorithms, or something very much like them’. (shrink)

Cognitive scientists use computational models to represent the results of their experimental work and to guide further research. Neither of these claims is particularly controversial, but the philosophical and evidentiary statuses of these models are hotly debated. To clarify the issues, I return to Newell and Simon’s 1972 exposition on the computational approach; they herald its ability to describe mental operations despite that the neuroscience of the time could not. Using work on visual imagery (cf. imagination) as a guide, I (...) examine the extent to which this holds true today. Does contemporary neuroscience contain mechanisms capable of describing experimental results in imagery? I argue that it does not, first by exploring foundational achievements in imagery research then by showing that their neural basis cannot be specified. Newell and Simon’s methodological position accordingly stands, even 50 years later. Computational — as opposed to physiological — descriptions must be retained to characterize and study mental phenomena, even as we learn high-level details of their implementation via brain data. (shrink)

How all philosophical explanations of human consciousness and the fundamental structure of the cosmos are bizarre—and why that’s a good thing Do we live inside a simulated reality or a pocket universe embedded in a larger structure about which we know virtually nothing? Is consciousness a purely physical matter, or might it require something extra, something nonphysical? According to the philosopher Eric Schwitzgebel, it’s hard to say. In The Weirdness of the World, Schwitzgebel argues that the answers to these fundamental (...) questions lie beyond our powers of comprehension. We can be certain only that the truth—whatever it is—is weird. Philosophy, he proposes, can aim to open—to reveal possibilities we had not previously appreciated—or to close, to narrow down to the one correct theory of the phenomenon in question. Schwitzgebel argues for a philosophy that opens. According to Schwitzgebel’s “Universal Bizarreness” thesis, every possible theory of the relation of mind and cosmos defies common sense. According to his complementary “Universal Dubiety” thesis, no general theory of the relationship between mind and cosmos compels rational belief. Might the United States be a conscious organism—a conscious group mind with approximately the intelligence of a rabbit? Might virtually every action we perform cause virtually every possible type of future event, echoing down through the infinite future of an infinite universe? What, if anything, is it like to be a garden snail? Schwitzgebel makes a persuasive case for the thrill of considering the most bizarre philosophical possibilities. (shrink)

Over the last two years, the third wave of artificial intelligence (AI) has emerged powerful tools for both artistic expression and scientific research. In design, image generators display an equivalent disruption to text generators, while the medium of text creates the new scope of writing prompts. This contribution discusses the ambivalences between text and image generators via two main theses: first about the potential of prompting and generated images as a medium of discourse; second, it examines the reasoning behind their (...) tendency to be mystified. Prompts can be automated through text generators and used to generate images on a wider scale, making it a praxis in which precise wording becomes crucial for generating anything. Generated images practice a form of mimesis. With Generative Adversial Networks (GANs) producing non-referential images, the discourse of illustration is concerning the obsolescence of authorship. AI is observed to manifest a dual character, serving as both tool and author, even though AI does not own the classification of a person and is not an author in legal terms. The utilization of text and image generators is intertwined with a mythicized notion due to their non-verifiable mode of operation. The myth of AI is a product of its indeterminacy. (shrink)

Wenn Künstliche Intelligenz (KI) Texte generieren kann, was sagt das darüber, was ein Text ist? Worin unterscheiden sich von Menschen geschriebene und mittels KI generierte Texte? Welche Erwartungen, Befürchtungen und Hoffnungen hegen Wissenschaften, wenn in ihren Diskursen KI-generierte Texte rezipiert werden und Anerkennung finden, deren Urheberschaft und Originalität nicht mehr eindeutig definierbar sind? Wie verändert sich die Arbeit mit Quellen und welche Konsequenzen ergeben sich daraus für die Kriterien wissenschaftlicher Textarbeit und das Verständnis von Wissenschaft insgesamt? Welche Chancen, Grenzen und (...) Risiken besitzen KI-Textgeneratoren aus Sicht von Technikethik und Technikfolgenabschätzung? Und welche Kriterien sind für einen ethisch bewussten Umgang mit KI-Textgeneratoren im Bildungskontext anzulegen? Diese und ähnliche Fragen verdeutlichen die Komplexität und Tragweite der Herausforderung, die der stetig wachsende und zunehmend selbstverständliche Einsatz von KI-Textgeneratoren für das zukünftige Arbeiten mit und an Texten mit sich bringt. Hierbei kristallisieren sich Problematiken heraus, die sich an ein breites Spektrum von Disziplinen wenden, deren spezifischen Diskurse in diesem Band beleuchtet werden. (shrink)

Computational functionalism posits that consciousness is a computation. Here we show, perhaps surprisingly, that it cannot be a Turing computation. Rather, computational functionalism implies that consciousness is a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation.

Provides a comprehensive overview and introduction to the Routledge Handbook of Propositions.

Some defenders of so-called `artificial intelligence' believe that machines can understand language. In particular, Søgaard has argued in his "Understanding models understanding language" (2022) for a thesis of this sort. His idea is that (1) where there is semantics there is also understanding and (2) machines are not only capable of what he calls `inferential semantics', but even that they can (with the help of inputs from sensors) `learn' referential semantics. We show that he goes wrong because he pays insufficient (...) attention to the difference between language as used by humans and the sequences of inert symbols which arise when language is stored on hard drives or in books in libraries. (shrink)

This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

Theories of rational decision making often abstract away from computational and other resource limitations faced by real agents. An alternative approach known as resource rationality puts such matters front and center, grounding choice and decision in the rational use of finite resources. Anticipated by earlier work in economics and in computer science, this approach has recently seen rapid development and application in the cognitive sciences. Here, the theory of rationality plays a dual role, both as a framework for normative assessment (...) and as a source of scientific hypotheses about how mental processes in fact work. The latter project, often called rational analysis, depends for its success on a fine-grained characterization of the computational problem facing a decision maker, which may in turn depend on realistic assumptions about what the relevant agent is like. As a consequence, resource rationality involves a delicate, but often fruitful interplay between the normative and the descriptive. (shrink)

Tercera Cultura: #TheLibro es una introducción a las ciencias cognitivas -Psicología, Lingüística, Filosofía, Neurociencia, Antropología, Inteligencia Artificial- escrita en un lenguaje simple y claro, ilustrado con ejemplos de la cultura popular, dirigido a estudiantes y geeks de todas las edades.

I examine the classical idea of ‘algorithm’ as a sequential, step-by-step, deterministic procedure (i.e., the idea of ‘algorithm’ that was already in use by the 1930s), with respect to three themes, its relation to the notion of an ‘effective procedure’, its different roles and uses in logic, computer science, and mathematics (focused on numerical analysis), and its different formal definitions proposed by practitioners in these areas. I argue that ‘algorithm’ has been conceptualized and used in contrasting ways in the above (...) areas, and discuss challenges and prospects for adopting a final foundational theory of (classical) ‘algorithms’. (shrink)

Nous proposons une étude de la constitution du sens dans l'interaction humain-machine à partir des définitions que donnent Turing et Wittgenstein à propos de la pensée, la compréhension, et de la décision. Nous voulons montrer par l'analyse comparative des proximités et différences conceptuelles entre les deux auteurs que le sens commun entre humains et machines se co-constitue dans et à partir de l'action, et que c'est précisément dans cette co-constitution que réside la valeur sociale de leur interaction. Il s'agira pour (...) cela de problématiser l'interaction humain-machine autour de la question de ce que signifie « suivre une règle » pour définir et distinguer les modes interprétatifs et les comportements décisionnels de chacun. Nous en viendrons alors au constat que la mutualisation des signes qui s'opère à travers le dialogue humain-machine est au fondement de la constitution d'une société informatisée. (shrink)

This paper presents the main topics, arguments, and positions in the philosophy of AI at present (excluding ethics). Apart from the basic concepts of intelligence and computation, the main topics of ar-tificial cognition are perception, action, meaning, rational choice, free will, consciousness, and normativity. Through a better understanding of these topics, the philosophy of AI contributes to our understand-ing of the nature, prospects, and value of AI. Furthermore, these topics can be understood more deeply through the discussion of AI; so (...) we suggest that “AI Philosophy” provides a new method for philosophy. (shrink)

Turing made strong statements about the future of machines in society. This article asks how they can be interpreted to advance our understanding of Turing’s philosophy. His irony has been largely caricatured or minimized by historians, philosophers, scientists, and others. Turing is often portrayed as an irresponsible scientist, or associated with childlike manners and polite humor. While these representations of Turing have been widely disseminated, another image suggested by one of his contemporaries, that of a nonconformist, utopian, and radically progressive (...) thinker reminiscent of the English Romantic poet Percy B. Shelley, has remained largely underexplored. Following this image, I will reconstruct the argument underlying what Turing called (but denied being guilty of) his “Promethean irreverence” (1947–1951) as a utopian satire directed against chauvinists of all kinds, especially intellectuals who might sacrifice independent thought to maintain their power. These, Turing hoped, would eventually be rivaled and surpassed by intelligent machines and transformed into ordinary people, as work once considered “intellectual” would be transformed into non-intellectual, “mechanical” work. I study Turing’s irony in its historical context and follow the internal logic of his arguments to their limit. I suggest that Turing genuinely believed that the possibilities of the machines he envisioned were not utopian dreams, and yet he conceived them from a utopian frame of mind, aspiring to a different society. His ever-learning child machines, whose intelligence would grow out of their own individual experiences, would help distribute power. (shrink)

This paper sheds light on the shift that is taking place from the practice of ‘coding’, namely developing programs as conventional in the software community, to the practice of ‘curing’, an activity that has emerged in the last few years in Deep Learning (DL) and that amounts to curing the data regime to which a DL model is exposed during training. Initially, the curing paradigm is illustrated by means of a study-case on autonomous vehicles. Subsequently, the shift from coding to (...) curing is analysed taking into consideration the epistemological notions, central in the philosophy of computer science, of function, implementation, and correctness. First, it is illustrated how, in the curing paradigm, the functions performed by the trained model depend much more on dataset curation rather than on the model algorithms which, in contrast with the coding paradigm, do not comply with requested specifications. Second, it is highlighted how DL models cannot be considered implementations according to any of the available definitions of implementation that follow an intentional theory of functions. Finally, it is argued that DL models cannot be evaluated in terms of their correctness but rather in their experimental computational validity. (shrink)

Las máquinas aceleradas de Turing (ATMs) son dispositivos capaces de ejecutar súper-tareas. Sin embargo, el simple ejercicio de definirlas ha generado varias paradojas. En el presente artículo se definirán las nociones de súper-tarea y ATM de manera exhaustiva y se aclarará qué debe entenderse en un contexto lógico-formal cuando se pregunta por la existencia de un objeto. A partir de la distinción entre posibilidades lógicas y físicas se disolverán las paradojas y se concluirá que las ATMs son posibles y existen (...) como objetos abstractos. (shrink)

A ‘Black Box’ cannot be opened to reveal its mechanism. Rather, its operations are inferred through input from (and output to) an ‘observer’. All of us are observers, who attempt to understand the Black Boxes that are Minds. The Black Box and its observer constitute a system, differing from either component alone: a ‘greater’ Black Box to any further-external-observer. To Glanville (1982), the further-external-observer probes the greater-Black-Box by interacting directly with its core Black Box, ignoring that Box’s immediate observer. In (...) later accounts, however, Glanville’s greater-Black-Box inexplicably becomes unitary. Why the discrepancy? To resolve it, we start with von Foerster’s archetype ‘machines’, that are of two kinds: ‘Trivial’ (predictable) and ‘Non-Trivial’ (non-predictable). Early-on, Glanville treated the core Black Box and its observer as Trivial Machines, that gradually ‘whiten’ (reveal) each other though input and output, becoming ‘white boxes’. Later, however, Black Box and observer became Non-Trivial Machines, never fully ‘whitenable’. But Non-Trivial Machines can be concatenated from Trivial Machines, and are the only true Black Boxes; any greater-Black-Box (Non-Trivial Machine) may (within its core Black Box) involve white boxes (that are Trivial Machines). White boxes, therefore, could be the ultimate source of the greatest Black Box of all: the Mind. (shrink)

Representationalist accounts of mental content face the threat of the homunculus fallacy. In collapsing the distinction between the conscious state and the conscious subject, self-representational accounts of consciousness possess the means to deal with this objection. We analyze a particular sort of self-representational theory, built on the work of John von Neumann on self-reproduction, using tools from mathematical logic. We provide an explicit theory of the emergence of referential beliefs by means of modal fixed points, grounded in intrinsic properties yielding (...) the subjective aspects of experience. Furthermore, we study complications introduced by allowing for the modification of such symbolic content by environmental influences. (shrink)

Alan Turing is often portrayed as a materialist in secondary literature. In the present article, I suggest that Turing was instead an idealist, inspired by Cambridge scholars, Arthur Eddington, Ernest Hobson, James Jeans and John McTaggart. I outline Turing’s developing thoughts and his legacy in the USA to date. Specifically, I contrast Turing’s two notions of computability (both from 1936) and distinguish between Turing’s “machine intelligence” in the UK and the more well-known “artificial intelligence” in the USA. According to my (...) proposed historical interpretation, Turing did not view computations in the real world to be exhaustively and deterministically characterized by his automatic machines from 1936. (shrink)

In a series of papers published in the sixties and seventies, Jaakko Hintikka, drawing upon Kant’s conception, defines an argument to be analytic whenever it does not introduce new individuals into the discussion and argues that there exists a class of arguments in polyadic first-order logic that are to be synthetic according to this sense. His work has been utterly overlooked in the literature. In this paper, I claim that the value of Hintikka’s contribution has been obscured by his formalisation (...) of the original definition. Therefore, I provide (i) a brief reconstruction of the historical framework of the problem and the revolutionary import of Hintikka’s contribution, (ii) a clarification of the most complicated steps of Hintikka’s elaboration of his insight, (iii) a criticism of several features that play a fundamental role in Hintikka’s formalisation and (iv) a selection from Hintikka’s own material of some valuable suggestions towards a clear and workable formalisation. As for the pars construens, I isolate in the approach of depth-bounded first-order logics (D'Agostino et al. 2021) an alternative formalisation of the notion of syntheticity as the introduction of new individuals in the reasoning, and I show that it is not affected by the same difficulties as Hintikka’s proposal. In so doing, I hope to have contributed to the realisation of the project of rehabilitating Kant’s analytic–synthetic distinction in the context of modern first-order logic with the purpose of showing, against the logical empiricist movement, that logic is not analytic. (shrink)

Influence theory is a systematic study of formal models of the communicative influence of one person or group of people on another person or group. In that sense influence theory is an overarching philosophical discipline that includes aspects of decision theory and game theory as sub-disciplines as well as established models of de facto segregation, cultural change, opinion polarization, and epistemic networks. What we offer here is a structured outline of formal results that have been scattered across a range of (...) disciplinary contexts from mathematics, physics and computer science to economics and political science, supplemented with a number of new models, emphasizing their place within the philosophical framework of a general theory of influence. What such an outline offers, we propose, is the prospect of new and important cross-fertilizations and expansions in formal attempts to model the diverse patterns of communicative influence. (shrink)

It is widely thought that chance should be understood in reductionist terms: claims about chance should be understood as claims that certain patterns of events are instantiated. There are many possible reductionist theories of chance, differing as to which possible pattern of events they take to be chance-making. It is also widely taken to be a norm of rationality that credence should defer to chance: special cases aside, rationality requires that one’s credence function, when conditionalized on the chance-making facts, should (...) coincide with the objective chance function. It is a shortcoming of a theory of chance if it implies that this norm of rationality is unsatisfiable. The primary goal of this paper is to show, on the basis of considerations concerning computability and inductive learning, that this shortcoming is more common than one would have hoped. (shrink)

Virtual objects, such as online shops, the elements that go to make up virtual life in computer games, virtual maps, e-books, avatars, cryptocurrencies, chatbots, holograms, etc., are a phenomenon we now encounter at every turn: they have become a part of our life and our world. Philosophers—and ontologists in particular—have sought to answer the question of what, exactly, they are. They fall into two camps: some, pointing to the chimerical character of virtuality, hold that virtual objects are like dreams, illusions (...) and fictions, while others, citing the real impact of virtuality on our world, take them to be real—an actual part of the real world, just like other real objects. In this article, we defend the thesis that both sides are wrong. Using Roman Ingarden’s phenomenological ontology, we advocate a position according to which a virtual object is a computationally grounded intentional object that has its existential foundation in computational processes, which are compliant with a certain model of computation. We point out that virtuality is framed by some kind of ideal mathematical objects: i.e., mathematical models of computation, which in turn fall, each of them, under their respective ideas. We also refer to the idea of natural computation, which in conjunction with the ontological analysis carried out leads to the thesis that an object can be more or less virtual. (shrink)

The degrees of belief of rational agents should be guided by the evidence available to them. This paper takes as a starting point the view—argued elsewhere—that the formal model best able to capture this idea is one that represents degrees of belief using Dempster–Shafer belief functions. However degrees of belief should not only respect evidence: they also guide decision and action. Whatever formal model of degrees of belief we adopt, we need a decision theory that works with it: that takes (...) as input degrees of belief so represented. The task of this paper is to develop such a decision theory for the belief function model of degrees of belief. This is not the first paper to attempt that task, but compared to the existing literature it takes a more abstract route to its destination, via a consideration of the very idea of rational decision making in light of one’s beliefs and desires. After presenting the new decision theory and comparing it to existing views, the paper goes on to consider diachronic decision situations. (shrink)

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...) undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

Three special issues of Entropy journal have been dedicated to the topics of “InformationProcessing and Embodied, Embedded, Enactive Cognition”. They addressed morphological computing, cognitive agency, and the evolution of cognition. The contributions show the diversity of views present in the research community on the topic of computation and its relation to cognition. This paper is an attempt to elucidate current debates on computation that are central to cognitive science. It is written in the form of a dialog between two authors (...) representing two opposed positions regarding the issue of what computation is and could be, and how it can be related to cognition. Given the different backgrounds of the two researchers, which span physics, philosophy of computing and information, cognitive science, and philosophy, we found the discussions in the form of Socratic dialogue appropriate for this multidisciplinary/cross-disciplinary conceptual analysis. We proceed as follows. First, the proponent (GDC) introduces the info-computational framework as a naturalistic model of embodied, embedded, and enacted cognition. Next, objections are raised by the critic (MM) from the point of view of the new mechanistic approach to explanation. Subsequently, the proponent and the critic provide their replies. The conclusion is that there is a fundamental role for computation, understood as information processing, in the understanding of embodied cognition. (shrink)

In this paper, we address the question of what current computers are from the point of view of human-computer interaction. In the early days of computing, the Turing machine (TM) has been the cornerstone of the understanding of computers. The TM defines what can be computed and how computation can be carried out. However, in the last decades, computers have evolved and increasingly become interactive systems, reacting in real-time to external events in an ongoing loop. We argue that the TM (...) does not provide a mechanistic explanation for interactive computing. The reason is that the fundamental phenomena relevant to interactive computing are out of the scope of classical computability theory. Part of the explanatory power of the TM relies on what we propose to call an execution model. An execution model belongs to a level of abstraction where it is possible to describe both the functional architecture and the execution in mechanistic terms. An updated execution model is warranted to provide the minimal mechanistic description for interactive computation as a counterpart of what the TM could explain regarding Church-Turing computation. It would support an explanation of the ubiquitous computing devices we know - those interacting with humans, e.g., through digital interfaces. We show that such a model is not available within interactive models of computation and that relevant abstractions and concerns are available in computer engineering but need to be identified and gathered. To fill this void, we propose to reflect on the level of abstraction required to support the mechanistic description of an interactive execution and propose some preliminary requirements. (shrink)

The Aristotelian origins of formal systems are outlined, together with Aristotle's use of causal terms in describing syllogisms. The precision and exactness of a formalism, based on the projection of logical forms into perceptive signs, is contrasted with foundational, abstract concepts, independent of any formalism, which are presupposed for the understanding of a formal language. The definition of a formal system by means of a Turing machine is put in the context of Wittgenstein's general considerations of a machine understood as (...) a sign. A modification of Łukasiewicz's logic Ł3 with the inclusion of justification terms is proposed in order to formally analyse some features of formalistic reasoning as a mechanical, causal affair within a wider context of "indeterminacy". (shrink)

This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of an (...) effective procedure--without reliance on any (partially) mathematical thesis or conjecture concerning effective procedures, such as the Church–Turing thesis--that the class of effective procedures is undecidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. The proof does not appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of such a procedure. Though this undecidability result itself is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure is, in fact, a decision procedure, i.e., effective—for example, that it invariably terminates with the correct verdict. (shrink)

The present PhD dissertation aims to examine the relation between modality and change in Aristotle’s metaphysics. -/- On the one hand, Aristotle supports his modal realism (i.e., worldly objects have modal properties - potentialities and essences - that ground the ascriptions of possibility and necessity) by arguing that the rejection of modal realism makes change inexplicable, or, worse, banishes it from the realm of reality. On the other hand, the Stagirite analyses processes by means of modal notions (‘change is the (...) actuality of what is virtual insofar as it is virtual’). In other words: to grasp what change is, one has to resort to the modal idiom of potentialities, while the fact that there is change is indicative of the fact that nature is full of modal properties. -/- Aristotle’s modal and kinetic realism finds a negative in the figure of the Megaric Diodorus Kronus. The polemical situation of Greek philosophy has indeed the dialectical advantage of not opposing the Aristotelian position to a sui generis straw man. Both in its reduction of modal judgements to temporal quantifications and in its dissolution of the reality of the state-of-being-in-motion in favour of a cinematographic view of processes, the philosophical figure of reductionist antirealism embodied by Diodorus constitutes an alternative that takes the opposite view of Aristotle’s realism. -/- The present study is structured as a discussion between these two positions. In the face of Diodorus’ antirealist challenges, Aristotle articulates modal and kinetic considerations: the answers he gives to Diodorus’ puzzles thus provide valuable insight into his metaphysics. Moreover, the examination of Aristotle’s and Diodorus’ metaphysics, because of their insight and originality, will not fail to interest the philosopher concerned with the metaphysical foundations of modern physics, insofar as the entanglement between modalities and processes is nowadays at the core of mechanics (phase spaces, path integrals, etc.). (shrink)

This work presents a post-positivist research framework to explain any surprising fact in the evolutionary path of a complex, dynamic and contingent social phenomenon. Primarily, it reconciles the ontological and epistemological assumptions of Critical Realism with the principles of American Pragmatism. Then, the research approach is presented: theoretical propositions about a social structure are translated into a set of grammar rules that acknowledges a pattern of sequences of events of either individual action or social interaction between actors within a real (...) social system. The result is a discrete mathematical model for a concrete category of social process based on these rules. Finally, data-grounded refinement of the theory is possible by the comparison between cases belonging to the same category, but differing about some contingent pattern of sequences of event outcomes. Consequently, their grammars differ in some pairs of context-sensitive rules that can explain this surprising fact, such that the derivation of this alternative historical trajectory of event outcomes becomes an extension to the early category of social process. In this sense, the proposed framework suggests there is a hierarchy of classes of grammars for middle-range explanations based upon the ontological assumption of the generative nature of social reality. (shrink)

The most recent tool for acting on the world, the exosomatization of cognitive activities, is often considered an autonomous and objective replacement of knowledge construction. We show the intrinsic limits of the mechanistic myths in AI, from classical to Deep Learning techniques, and its relation to the human construction of sense. Human activities in a changing ecosystem – in their somatic and sensible dimensionalities proper to any living experiences – are at the core of our analysis. By this, we stress (...) the key role of the knowing subject, far away from any allegedly objective big collections of data. The production of organized structures of physics, biology and in societal analysis will be compared and distinguished by trying to set on more robust grounds the constructive as well as the disruptive roles of entropic, negentropic, anti-entropic dynamics that are different concepts in different domains, to be handled with care: the use of machine learning and optimization methods as tools and models to analyse and manage human activities in view of their scientific and political ideology of technoscientific governance. They suppose that which they try to produce is objective, that is, standardized and controllable behaviours. In this dialogue we stress a mirror symmetry between the lack of theoretical interpretation of scientific data and the lack of democracy in this fiction of neutrality. Moreover, bad analogies constitute an obstacle to grasp the anteriority of biological and ecological constraints which enable and limit all artificial products of human intelligence. We will thus stress biological specificity, the role of normativity and constraints in evolution, of labour in structuring the human historical construction of sense by common activities. (shrink)