Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding our practical limits. In this chapter I argue that the science of \emph{quantum computing} illuminates complexity theory by emphasising that its fundamental concepts are not model-independent, but that this does not, as some suggest, force us to radically (...) revise the foundations of the theory. For model-independence never has been essential to those foundations. The fundamental aim of complexity theory is to describe what is achievable in practice under various models of computation for our various practical purposes. Reflecting on quantum computing illuminates complexity theory by reminding us of this, too often under-emphasised, fact. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm (...) was soon followed by several other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

A central aim of cognitive science is to understand the fundamental mechanisms that enable humans to navigate and make sense of complex environments. In this letter, we argue that computational complexity theory, a foundational framework for evaluating computational resource requirements, holds significant potential in addressing this challenge. As humans possess limited cognitive resources for processing vast amounts of information, understanding how humans perform complex cognitive tasks requires comprehending the underlying factors that drive information processing demands. Computational (...) complexity theory provides a comprehensive theoretical framework to achieve this goal. By adopting this framework, we can gain new insights into how cognitive systems work and develop a more nuanced understanding of the relation between task complexity and human behavior. We provide empirical evidence supporting our argument and identify several open research questions and challenges in applying computational complexity theory to human decision‐making and cognitive science at large. (shrink)

The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in (...) automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory. It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions. (shrink)

This paper examines from a special perspective the problem of methodological limita­tions of the computational approach in the philosophy of mind and empirical sciences. The main goal is to consistently substantiate the dependence of philosophical “metaphori­cal dictionaries” on advances in the field of computer science, historical contexts of epis­temology, formal and methodological limitations of algorithmic and computational proce­dures. The key idea is that despite the success of computational models in empirical re­search, their conceptual level does not allow us to correctly (...) formulate the question of the ontology of consciousness. Computationalism in philosophical theories of con­sciousness is presented as a practice of word usage, which posits systems of consistent descriptions of the information properties of consciousness and cognitive processes within the framework of certain methodological rules. The limitations of the computa­tional approach are associated with the lack of a scientific theory of subjectivity, the fun­damental irreducibility of external properties of consciousness to internal states, and fun­damental restrictions on the completeness and consistency of computer mathematics. A classification of several anti-computational programs has been carried out. The article discusses various limitations of computational approaches, such as: the complexity of for­malizing nonlinear and hidden processes, the dependence of emotions and intuition on the situational context and individual differences, the difficulty of predicting the emerg­ing properties of autonomous and autopoietic systems, and the limitations associated with non-standard computational processes of quantum and dynamic phenomena. A special role is given to the problem of set-theoretic reductive realism within the framework of mathe­matical structuralism and some aspects of p-adic number systems as a possible alternative to a “universal language” for the computational philosophy of consciousness. (shrink)

Information Theory, Evolution and The Origin ofLife: The Origin and Evolution of Life as a Digital Message: How Life Resembles a Computer, Second Edition. Hu- bert P. Yockey, 2005, Cambridge University Press, Cambridge: 400 pages, index; hardcover, US $60.00; ISBN: 0-521-80293-8. The reason that there are principles of biology that cannot be derived from the laws of physics and chemistry lies simply in the fact that the genetic information content of the genome for constructing even the simplest (...) organisms is much larger than the information content of these laws. Yockey in his previous book (1992, 335) In this new book, Information Theory, Evolution and The Origin ofLife, Hubert Yockey points out that the digital, segregated, and linear character of the genetic information system has a fundamental significance. If inheritance would blend and not segregate, Darwinian evolution would not occur. If inheritance would be analog, instead of digital, evolution would be also impossible, because it would be impossible to remove the effect of noise. In this way, life is guided by information, and so information is a central concept in molecular biology. The author presents a picture of how the main concepts of the genetic code were developed. He was able to show that despite Francis Crick's belief that the Central Dogma is only a hypothesis, the Central Dogma of Francis Crick is a mathematical consequence of the redundant nature of the genetic code. The redundancy arises from the fact that the DNA and mRNA alphabet is formed by triplets of 4 nucleotides, and so the number of letters (triplets) is 64, whereas the proteome alphabet has only 20 letters (20 amino acids), and so the translation from the larger alphabet to the smaller one is necessarily redundant. Except for Tryptohan and Methionine, all amino acids are coded by more than one triplet, therefore, it is undecidable which source code letter was actually sent from mRNA. This proof has a corollary telling that there are no such mathematical constraints for protein-protein communication. With this clarification, Yockey contributes to diminishing the widespread confusion related to such a central concept like the Central Dogma. Thus the Central Dogma prohibits the origin of life "proteins first." Proteins can not be generated by "self-organization." Understanding this property of the Central Dogma will have a serious impact on research on the origin of life. (shrink)

Intelligent design advocate William Dembski has introduced a measure of information called “complex specified information”, or CSI. He claims that CSI is a reliable marker of design by intelligent agents. He puts forth a “Law of Conservation of Information” which states that chance and natural laws are incapable of generating CSI. In particular, CSI cannot be generated by evolutionary computation. Dembski asserts that CSI is present in intelligent causes and in the flagellum of Escherichia coli, and concludes (...) that neither have natural explanations. In this paper, we examine Dembski’s claims, point out significant errors in his reasoning, and conclude that there is no reason to accept his assertions. (shrink)

Fundamental Theory has been called an "unfinished symphony" and "a challenge to the musicians among natural philosophers of the future". This book, written in 1944 but left unfinished because Eddington died too soon, proved to be his final effort at a vision for harmonization of quantum physics and relativity. The work is less connected and internally integrated than 'Protons and Electrons' while representing a later point in the author's thought arc. The really interested student should read both books together.The (...) physical and mathematical reasoning are very deep, but it is possible to enjoy much of the flavor of the book even without following everything. The tidbits given below illustrate Eddington's beautiful and mellifluous English style. This edition contains a clickable table of contents and some interesting illustrations.WARNING: Due to the complexity of the mathematical typesetting, the only way to reproduce this book has been as a series of scanned page images. We believe this work is scientifically and culturally important, and despite a few imperfections and the inevitably small print, have brought it back into print as part of our continuing commitment to the preservation of Eddington's work. On a portable electronic reader the pages come out pretty small, but they are legible. On a desktop computer running the Amazon app, they are perfectly fine. We appreciate your understanding, and hope you enjoy this valuable book.TIDBITS:The number of protons and electrons in the universe would, in itself, be merely a matter of idle curiosity. But N has a more general significance as a fundamental constant which enters into many physical formulae. Its special interpretation as the number of particles in the universe arises in the following way. If we consider a distribution of hydrogen in equilibrium at zero temperature, the presence of the matter produces a curvature of space, and the curvature causes the space to close when the number of particles contained in it reaches a certain total; that number is N. The present investigation seeks to determine N directly from the principles of measurement. We have to show, not that there are N particles in the universe, but that anyone who accepts certain elementary principles of measurement must, if he is consistent, think there are. We have to express in mathematical symbolism what we think we are doing when we measure things; for if we had no conception of what we were doing, the results of the measurements would not persuade us to believe anything in particular. All our results are derived from the condition that the conceptual interpretation which we place on the results of measurement must be consistent with our conceptual interpretation of the process of measurement.If we play about with a pin and a meter standard, we do not become aware of any number in particular unless the standard has been graduated, or unless we use a process of displacement which we interpret as adding pin-extensions. The fact is that, although measurement is primarily a process involving four entities, the conceptual interpretation of measurement postulates in addition the existence (in the structure contemplated) as something referred to as Z. The existence of Z is the condition that makes graduation an exact concept. In the actual universe there exists a basis which is uniform to a very high approximation, and this serves for almost all purposes; but to the much higher approximation required in the calculation of N the ideal exact basis of uniformity does not exist. The finitude of N is, in fact, the cause of the failure of the approximation.It must be remembered that we are now working to what would ordinarily be considered a fantastically high approximation. For ordinary purposes a measurable has 16 eigenvalues; but under the super-magnification here employed (which is not content to overlook 1 part in 10E39) there is a fine structure which splits each of them into 16 components. (shrink)

The project of this Précis de philosophie de la logique et des mathématiques (vol. 1 under the direction of F. Poggiolesi and P. Wagner, vol. 2 under the direction of A. Arana and M. Panza) aims to offer a rich, systematic and clear introduction to the main contemporary debates in the philosophy of mathematics and logic. The two volumes bring together the contributions of thirty researchers (twelve for the philosophy of logic and eighteen for the philosophy of mathematics), (...) specialists in the history or philosophy of logic or mathematics. Each volume consists of ten chapters; each chapter is about forty pages, is independent from the others and deals with a particular philosophical question about logic or mathematics. The objective is to offer to the French-speaking reader a reference book. On many of the issues addressed, this Précis offers the first clear and thorough synthesis that is available in French. -/- This book is intended for third year / master's students, but also for teachers of philosophy in secondary or higher education, for logicians and mathematicians willing to take a philosophical look at the fundamental concepts of their discipline, and for any reader interested in the basic issues discussed in the philosophy of logic and mathematics. Each chapter is self-contained, although some basic training in logic (or in mathematics, as the case may be) is required. The book should be looked at as a comprehensive framework for contemporary discussions in the philosophy of logic and mathematics, while also giving some guidance on the disciplinary content required by these discussions. -/- The first three chapters of the present volume (on the philosophy of mathematics) are devoted to the history of the philosophy of mathematics: from antiquity to the modern era, and from this period to the foundational crisis of the nineteenth century, to the twentieth century. Next, four chapters deal with the crucial questions for the philosophy of mathematics of the twentieth century: the opposition and/or comparison of set theory and category theory as foundational frameworks for mathematics; mathematical constructivism; the analysis of calculability; and Benaceraff's problem. The two following chapters are focused on the philosophy of mathematical practice, by treating the notion of ideals of proof, in particular explanation and purity, and the notion of informal proof and the use of visual artifacts in mathematical argumentation. Finally the last chapter deals with the applicability of mathematics, including the role of probability. -/- In Chapter 1, Sébastien Maronne and David Rabouin present the history of the philosophy of mathematics from antiquity to the modern era. The goal is to show that the philosophy of mathematics has a history as ancient as mathematics and philosophy itself, a history largely continuous with the latter, often by staying out of sync with respect to the former. In Chapter 2, Sébastien Gandon discusses the question of the foundations of mathematics from Kant to the end of the nineteenth century. By tying this question to Kant, he is able to show that the discussion of the foundations of mathematics that occupied a large part of these two centuries has much older roots. Accent is placed on the differences between the framework proposed by Kant for making sense of classical mathematics and the use made by Frege and then Russell of logical tools for giving a different reading of arithmetic and real analysis. The link between between these different conceptions and the evolution of mathematics itself is also underlined. -/- Chapter 3, written by Hourya Benis-Sinaceur and Mirna Džamonja, deals with the evolution of mathematics in the twentieth century, notably the structuralist turn of Dedekind, E. Noether, and Bourbaki, and certain more recent developments. They devote themselves, among other things, to explaining how these developments can be understood as responses to and extensions of questions posed during the foundational debate of the immediately preceding era. -/- In Chapter 4, Jean-Pierre Marquis and Jean-Jacques Szczeciniarz discuss the different foundational options coming from set theory and category theory. They discuss, among other things, Lawvere's program to replace ZF with an axiomatization of the category of sets, the latter judged better adapted to the needs of contemporary mathematics. Different reactions, as much philosophical as technical, raised by this program are also taken into account. -/- Constructive mathematics are the object of Chapter 5, in which Gerhard Heinzmann and Mark van Atten examine in a critical and comparative manner a variety of constructivisms, including intuitionism, constructive type theory, predicativism, and finitism. -/- In Chapter 6, Guido Gherardi and Maël Pegny present computability theory, stressing its philosophical consequences. They discuss the basic concepts of this theory, for the computability of both the natural numbers and the real numbers. They then tackle the theory of computational complexity. -/- In Chapter 7, Andrea Sereni and Fabrice Pataut present Benacerraf's problem, opposing every possible account of mathematical knowledge to the availability of a theory of truth founded on an abstract ontology of mathematical objects. They give an overview of the original problem and its reformulation by Hartry Field, and reconstruct the debate that this problem has raised, by meeting at once the major opposing positions today of the analytic affiliation of the philosophy of mathematics, as much those on the platonist side as on that of nominalism. -/- In Chapter 8, Valeria Giardino and Yacin Hamami treat certain crucial aspects of the philosophy of mathematical practice. They deal in particular with the notion of an informal proof and on the role of artifacts in mathematical reasoning. They consider how such proofs, making use of these means, can contribute to the understanding of theorems and mathematical theories, thanks also to the role of visualisation and the aid of computer tools. -/- Why do mathematics often give several proofs of the same theorem? This is the question that Andrew Arana raises in Chapter 9, introducing the notion of an epistemic ideal and discuss two such ideals, the explanatoriness and purity of proof. -/- Chapter 10 is devoted to the applicability of mathematics in the study of empirical phenomena. After summarizing the history of this question, going back to Plato and Aristotle and passing by Mill and Kant, Daniele Molinini and Marco Panza reconstruct the contemporary debate, in relation, among other things, to questions raised in the philosophy of science. -/- Two appendices complete the volume. In the first Frédéric Patras treats the French tradition in philosophy of mathematics of the 20th century. In the second, Maria Carla Galavotti discusses the notion of probability and its use in science. (shrink)

Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility (...) in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof. (shrink)

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is (...) hoped will make this volume an invaluable resource for specialists and non-specialists alike. (shrink)

With the rapid expansion of parameters in large language models (LLMs) and the application of Reinforcement Learning with Human Feedback (RLHF), there has been a noticeable growth in the moral competence of LLMs. However, several questions warrant further exploration: Is it really possible for LLMs to fully align with human values through RLHF? How can the current moral growth be philosophically contextualized? We identify similarities between LLMs’ moral growth and Deweyan ethics in terms of the discourse of human moral development. (...) We then attempt to use Dewey’s theory on an experimental basis to examine and further explain the extent to which the current alignment pathway enables the development of LLMs. A beating experiment serves as the foundational case for analyzing LLMs’ moral competence across various parameters and stages, including basic moral cognition, moral dilemma judgment, and moral behavior. The results demonstrate that the moral competence of the GPT series has seen a significant improvement, and Dewey’s Impulse-Habit-Character theory of moral development can be used to explain this: the moral competence of LLMs has been enhanced through experience-based learning, supported by human feedback. Nevertheless, LLMs’ moral development through RLHF remains constrained and does not reach the character stage described by Dewey, possibly due to their lack of self-consciousness. This fundamental difference between humans and LLMs underscores both the limitations of LLMs’ moral growth and the challenges of applying RLHF for AI alignment. It also emphasizes the need for external societal governance and legal regulation. (shrink)

Marr’s seminal distinction between computational, algorithmic, and implementational levels of analysis has inspired research in cognitive science for more than 30 years. According to a widely-used paradigm, the modelling of cognitive processes should mainly operate on the computational level and be targeted at the idealised competence, rather than the actual performance of cognisers in a specific domain. In this paper, we explore how this paradigm can be adopted and revised to understand mathematical problem solving. The computational-level approach applies methods from (...) computational complexity theory and focuses on optimal strategies for completing cognitive tasks. However, human cognitive capacities in mathematical problem solving are essentially characterised by processes that are computationally sub-optimal, because they initially add to the computational complexity of the solutions. Yet, these solutions can be optimal for human cognisers given the acquisition and enactment of mathematical practices. Here we present diagrams and the spatial manipulation of symbols as two examples of problem solving strategies that can be computationally sub-optimal but humanly optimal. These aspects need to be taken into account when analysing competence in mathematical problem solving. Empirically informed considerations on enculturation can help identify, explore, and model the cognitive processes involved in problem solving tasks. The enculturation account of mathematical problem solving strongly suggests that computational-level analyses need to be complemented by considerations on the algorithmic and implementational levels. The emerging research strategy can help develop algorithms that model what we call enculturated cognitive optimality in an empirically plausible and ecologically valid way. (shrink)

Fundamental Theory has been called an "unfinished symphony" and "a challenge to the musicians among natural philosophers of the future". This book, written in 1944 but left unfinished because Eddington died too soon, proved to be his final effort at a vision for harmonization of quantum physics and relativity. The work is less connected and internally integrated than 'Protons and Electrons' while representing a later point in the author's thought arc. The really interested student should read both books together.The (...) physical and mathematical reasoning are very deep, but it is possible to enjoy much of the flavor of the book even without following everything. The tidbits given below illustrate Eddington's beautiful and mellifluous English style. This edition contains a clickable table of contents and some interesting illustrations.WARNING: Due to the complexity of the mathematical typesetting, the only way to reproduce this book has been as a series of scanned page images. We believe this work is scientifically and culturally important, and despite a few imperfections and the inevitably small print, have brought it back into print as part of our continuing commitment to the preservation of Eddington's work. On a portable electronic reader the pages come out pretty small, but they are legible. On a desktop computer running the Amazon app, they are perfectly fine. We appreciate your understanding, and hope you enjoy this valuable book.TIDBITS:The number of protons and electrons in the universe would, in itself, be merely a matter of idle curiosity. But N has a more general significance as a fundamental constant which enters into many physical formulae. Its special interpretation as the number of particles in the universe arises in the following way. If we consider a distribution of hydrogen in equilibrium at zero temperature, the presence of the matter produces a curvature of space, and the curvature causes the space to close when the number of particles contained in it reaches a certain total; that number is N. The present investigation seeks to determine N directly from the principles of measurement. We have to show, not that there are N particles in the universe, but that anyone who accepts certain elementary principles of measurement must, if he is consistent, think there are. We have to express in mathematical symbolism what we think we are doing when we measure things; for if we had no conception of what we were doing, the results of the measurements would not persuade us to believe anything in particular. All our results are derived from the condition that the conceptual interpretation which we place on the results of measurement must be consistent with our conceptual interpretation of the process of measurement.If we play about with a pin and a meter standard, we do not become aware of any number in particular unless the standard has been graduated, or unless we use a process of displacement which we interpret as adding pin-extensions. The fact is that, although measurement is primarily a process involving four entities, the conceptual interpretation of measurement postulates in addition the existence (in the structure contemplated) as something referred to as Z. The existence of Z is the condition that makes graduation an exact concept. In the actual universe there exists a basis which is uniform to a very high approximation, and this serves for almost all purposes; but to the much higher approximation required in the calculation of N the ideal exact basis of uniformity does not exist. The finitude of N is, in fact, the cause of the failure of the approximation.It must be remembered that we are now working to what would ordinarily be considered a fantastically high approximation. For ordinary purposes a measurable has 16 eigenvalues; but under the super-magnification here employed (which is not content to overlook 1 part in 10E39) there is a fine structure which splits each of them into 16 components. (shrink)

Against Nature – Chapter Abstracts Chapter 1. A Transdisciplinary Approach. In this short book you will find philosophy – metaphysical and political - economics, critical theory, complexity theory, ecology, sociology, journalism, and much else besides, along with the signposts and reference texts of the Information Systems field. Such transdisciplinarity is a challenge for both author and reader. Such books are often problematic: sections that are just old hat to one audience are by contrast completely new and (...) difficult to another. My hope is that in the interconnections, arguments and thrust of this polemic, readers will discover both interest and insight, alongside a range of new avenues to explore. This introductory chapter sets the scene – today’s digital world of Tech Giants and Fake News, its roots in the philosophical arguments of the 1920s, and the book’s key claims: (i) that the early 20th century philosophical grounding of today’s digital revolution is culpable in digital’s (growing) contribution to the ecological catastrophe unfolding in the 21st century; (ii) that process philosophy offers a new way to rethink that philosophical grounding, and reshape the digital revolution to support strategies to counter that catastrophe. Chapter 2. The Problem with Digital. This chapter begins with a brief overview of the research approaches in information systems as an academic field, before turning to the deeper roots of its malaise, in individualism, and its looming consequences. The three branches of Information Systems research, in academia, prove to be a useful lens through which to understand the field: Positivism, Interpretivism, and the Critical stance taken by this book. The ‘scientism’ at the root of positivism is examined, and the positivism in Information Systems critiqued as a historically contingent response to the ascendancy of a new brand of economics in Business Schools after the Second World War. But the computational market-fundamentalist form of economics sponsored in the 1950s (and applied by governments since the 1970s) centred around notions of the individual rational actor as an information processor. The philosophical underpinning of methodological and possessive individualism in this approach is exposed, and its influence upon the development – long before computing – of the science of ecology, and our notion of ecosystems, introduced. Chapter 3. The Future Does Not Exist. The philosophical core of the book, this chapter introduces process philosophy. Through an examination of the irreversible reality of subjectivity, Bergson’s famous notion of the durée reélle, and Whitehead’s critique of the bifurcation of subject and object, are introduced. The causally closed ‘time’ of positive science determines existence from the beginning to the end of the universe, be it three seconds or three trillion years. But the reality, of course, is that the future does not exist: our choices are real, and only one of myriad potential futures comes into being at each moment. As Bergson insists, durational succession exists, I am conscious of it; it is a fact. Bergson’s star – once the brightest of any living philosopher in the world – faded almost as quickly as it rose, under the onslaught from the logical positivists whose verificationism insisted that any proposition has no factual meaning if no evidence of observation can count for or against it: all ethics, aesthetics, romance, and metaphysics – and the very subjectivity with which duration is experienced - were thus closed down and dismissed. In this chapter it is reintroduced, to a new audience. Chapter 4. The World in a New Light. Many fundamental problems in the world can be seen as resulting from the false philosophy of bifurcation, fixity, and the reification of abstractions critiqued by process philosophy. Being – with all the isolation and focus upon the individual that it entails – must, if we are to address these problems, be seen as secondary to Becoming, with all the connection, interrelatedness, and complex collectivity that it implies. Choices become clearer, between positivism and interpretivism, between accents upon individualism or collectivism, between reductionist and complex adaptive systems approaches. The systemic individualism in Anglo-American societies can be regarded as actually harmful: the Tech Giants severing ties and bonds rather than connecting us; algebraic ecological models actually breaking the co-dependencies and co-requisites upon which real – complex - ecological health depends. Positivism, built as it is upon methodological individualism, seen in the light of process philosophy, becomes a danger to personal psychological balance – cutting us off from one another; a danger to the social fabric – undermining and impoverishing our civic life; and a danger to the ecological health of the planet – ignoring the immense (eco)systemic impact of our activities over the last centuries upon everything around us in the natural world. Chapter 5. A Theoretical Manifesto for Green IT. We are not islands, and in a process-relational social organisation much must be held in common. We are individuals, but we cannot survive alone. Four different perspectives on individualism show it to be little more than greed. An ecological economics reintegrating the household, the social, the supportive State, and – crucially – the life-giving earth into our polities is introduced and promoted. I introduce the concept of ‘Infomateriality’ – a non-bifurcated digital world where the physical bodies of people - fingers touching keyboards and eyes scanning screens - are as much ‘hardware’ as cabling, circuitboards and haptic interfaces, and the social practices, power relations, and embedded politics within IT artefacts define all such techné as fundamentally social. Abstract divisions are false, and whole, socially embedded systems should be the focus of IS, and from a philosophically and sociologically much deeper perspective. ‘Tech for Good’ is held up as movement in the right direction. My hope is that this book will help promote action, in the field of information systems, toward a better world, where Green Tech for Good is deployed for Nature, rather than against it. (shrink)

ACMES is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science. This volume includes a selection of papers presented at the 2015 and 2016 conferences held at Western University that provide an interdisciplinary outlook on modern applied mathematics that draws from theory and practice, and situates it in proper context. These papers come from leading mathematicians, computational scientists, and philosophers of science, and cover a broad collection of mathematical and philosophical (...) topics, including numerical analysis and its underlying philosophy, computer algebra, reliability and uncertainty quantification, computation and complexity theory, combinatorics, error analysis, perturbation theory, experimental mathematics, scientific epistemology, and foundations of mathematics. By bringing together contributions from researchers who approach the mathematical sciences from different perspectives, the volume will further readers' understanding of the multifaceted role of mathematics in modern science, informed by the state of the art in mathematics, scientific computing, and current modeling techniques. (shrink)

Reverse mathematics is a program in mathematical logic that seeks to give precise answers to the question of which axioms are necessary in order to prove theorems of "ordinary mathematics": roughly speaking, those concerning structures that are either themselves countable, or which can be represented by countable "codes". This includes many fundamental theorems of real, complex, and functional analysis, countable algebra, countable infinitary combinatorics, descriptive set theory, and mathematical logic. This entry aims to give the reader a (...) broad introduction to the history, methodology, and results of the reverse mathematics program, with a particular focus on its connections to foundational programs such as finitism, constructivism, and predicativism. (shrink)

First comprehensive introduction to information theory explores the work of Shannon, McMillan, Feinstein, and Khinchin. Topics include the entropy concept in probability theory, fundamental theorems, and other subjects. 1957 edition.

Information is a recognized fundamental notion across the sciences and humanities, which is crucial to understanding physical computation, communication, and human cognition. The Philosophy of Information brings together the most important perspectives on information. It includes major technical approaches, while also setting out the historical backgrounds of information as well as its contemporary role in many academic fields. Also, special unifying topics are high-lighted that play across many fields, while we also aim at identifying relevant themes (...) for philosophical reflection. There is no established area yet of Philosophy of Information, and this Handbook can help shape one, making sure it is well grounded in scientific expertise. As a side benefit, a book like this can facilitate contacts and collaboration among diverse academic milieus sharing a common interest in information. . First overview of the formal and technical issues involved in the philosophy of information . Integrated presentation of major mathematical approaches to information, form computer science, information theory, and logic . Interdisciplinary themes across the traditional boundaries of natural sciences, social sciences, and humanities. (shrink)

This is a comprehensive discussion of complexity as it arises in physical, chemical, and biological systems, as well as in mathematical models of nature. Common features of these apparently unrelated fields are emphasised and incorporated into a uniform mathematical description, with the support of a large number of detailed examples and illustrations. The quantitative study of complexity is a rapidly developing subject with special impact in the fields of physics, mathematics, information science, and biology. Because of (...) the variety of the approaches, no comprehensive discussion has previously been attempted. This book will be of interest to graduate students and researchers in physics (nonlinear dynamics, fluid dynamics, solid-state, cellular automata, stochastic processes, statistical mechanics and thermodynamics), mathematics (dynamical systems, ergodic and probability theory), information and computer science (coding, information theory and algorithmic complexity), electrical engineering and theoretical biology. (shrink)

Molecules have more or less symmetric and complex structures which can be defined in the mathematical framework of topology, group theory, dynamical systems theory, and quantum mechanics. But symmetry and complexity are by no means only theoretical concepts of research. Modern computer aided visualizations show real forms of matter which nevertheless depend on the technical standards of observation, computation, and representation. Furthermore, symmetry and complexity are fundamental interdisciplinary concepts of research inspiring the natural sciences since the (...) antiquity. (shrink)

Some mathematical theories in physics justify their explanatory superiority over earlier formalisms by the clarity of their postulates. In particular, axiomatic reconstructions drive home the importance of the composition rule and the continuity assumption as two pillars of quantum theory. Our approach sits on these pillars and combines new mathematics with a testable prediction. If the observer is defined by a limit on string complexity, information dynamics leads to an emergent continuous model in the critical regime. (...) Restricting it to a family of binary codes describing ‘bipartite systems,’ we find strong evidence of an upper bound on bipartite correlations equal to 2.82537. This is measurably different from the Tsirelson bound. The Hilbert space formalism emerges from this mathematical investigation as an effective description of a fundamental discrete theory in the critical regime. (shrink)

This volume contains the proceedings of three special sessions: Algebra and Computer Science, held during the Joint AMS-EMS-SPM meeting in Porto, Portugal, June 10–13, 2015; Groups, Algorithms, and Cryptography, held during the Joint Mathematics Meeting in San Antonio, TX, January 10–13, 2015; and Applications of Algebra to Cryptography, held during the Joint AMS-Israel Mathematical Union meeting in Tel-Aviv, Israel, June 16–19, 2014. Papers contained in this volume address a wide range of topics, from theoretical aspects of algebra, namely group (...) theory, universal algebra and related areas, to applications in several different areas of computer science. From the computational side, the book aims to reflect the rapidly emerging area of algorithmic problems in algebra, their computational complexity and applications, including information security, constraint satisfaction problems, and decision theory. The book gives special attention to recent advances in quantum computing that highlight the need for a variety of new intractability assumptions and have resulted in a new area called group-based cryptography. (shrink)

The first-order logical theory Th $({\mathbb{N}},x + 1,F(x))$ is proved to be complete for the class ATIME-ALT $(2^{O(n)},O(n))$ when $F(x) = 2^{x}$ , and the same result holds for $F(x) = c^{x}, x^{c} (c \in {\mathbb{N}}, c \ge 2)$ , and F(x) = tower of x powers of two. The difficult part is the upper bound, which is obtained by using a bounded Ehrenfeucht–Fraïssé game.

Arthur Clark and Michael Kube–McDowell (“The Triger”, 2000) suggested the sci-fi idea about the direct transformation from a chemical substance to another by the action of a newly physical, “Trigger” field. Karl Brohier, a Nobel Prize winner, who is a dramatic persona in the novel, elaborates a new theory, re-reading and re-writing Pauling’s “The Nature of the Chemical Bond”; according to Brohier: “Information organizes and differentiates energy. It regularizes and stabilizes matter. Information propagates through matter-energy and mediates (...) the interactions of matter-energy.” Dr Horton, his collaborator in the novel replies: “If the universe consists of energy and information, then the Trigger somehow alters the information envelope of certain substances –“. “Alters it, scrambles it, overwhelms it, destabilizes it” Brohier adds. There is a scientific debate whether or how far chemistry is fundamentally reducible to quantum mechanics. Nevertheless, the fact that many essential chemical properties and reactions are at least partly representable in terms of quantum mechanics is doubtless. For the quantum mechanics itself has been reformulated as a theory of a special kind of information, quantum information, chemistry might be in turn interpreted in the same terms. Wave function, the fundamental concept of quantum mechanics, can be equivalently defined as a series of qubits, eventually infinite. A qubit, being defined as the normed superposition of the two orthogonal subspaces of the complex Hilbert space, can be interpreted as a generalization of the standard bit of information as to infinite sets or series. All “forces” in the Standard model, which are furthermore essential for chemical transformations, are groups [U(1),SU(2),SU(3)] of the transformations of the complex Hilbert space and thus, of series of qubits. One can suggest that any chemical substances and changes are fundamentally representable as quantum information and its transformations. If entanglement is interpreted as a physical field, though any group above seems to be unattachable to it, it might be identified as the “Triger field”. It might cause a direct transformation of any chemical substance by from a remote distance. Is this possible in principle? (shrink)

The state of computing science and, particularly, software engineering and knowledge engineering is generally considered immature. The best starting point for achieving a mature engineering discipline is a solid scientific theory, and the primary reason behind the immaturity in these fields is precisely that computing science still has no such agreed upon underlying theory. As theories in other fields of science do, this paper formally establishes the fundamental elements and postulates making up a first attempt at (...) a theory in this field, considering the features and peculiarities of computing science. The fundamental elements of this approach are informons and holons, and it is a general and comprehensive theory of software engineering and knowledge engineering that related disciplines (e.g., information systems) can particularise and/or extend to take benefit from it (Lakatos’ concepts of core theory and protective belt theories). (shrink)

In various publications over the past years, Floridi has developed a theory of semantic information as well-formed, meaningful, and truthful data. This theory is more or less orthogonal to the standard entropy-based notions of information known from physics, information theory, and computer science that all define the amount of information in a certain system as a scalar value without any direct semantic implication. In this context the question rises what the exact relation between (...) these various conceptions of information is and whether there is a real need to enrich these mathematically more or less rigid definitions with a less formal notion of semantic information. I investigate various philosophical aspects of the more formal definitions of information in the light of Floridi’s theory. The position I defend is that the formal treatment of the notion of information as a general theory of entropy is one of the fundamental achievements of modern science that in itself is a rich source for new philosophical reflection. This makes information theory a competitor of classical epistemology rather than a servant. In this light Floridi’s philosophy of information is more a reprise of classical epistemology that only pays lip service to information theory but fails to address the important central questions of philosophy of information. Specifically, I will defend the view that notions that are associated with truth, knowledge, and meaning all can adequately be reconstructed in the context of modern information theory and that consequently there is no need to introduce a concept of semantic information. (shrink)

This book provides a unique survey displaying the power of Riccati equations to describe reversible and irreversible processes in physics and, in particular, quantum physics. Quantum mechanics is supposedly linear, invariant under time-reversal, conserving energy and, in contrast to classical theories, essentially based on the use of complex quantities. However, on a macroscopic level, processes apparently obey nonlinear irreversible evolution equations and dissipate energy. The Riccati equation, a nonlinear equation that can be linearized, has the potential to link these two (...) worlds when applied to complex quantities. The nonlinearity can provide information about the phase-amplitude correlations of the complex quantities that cannot be obtained from the linearized form. As revealed in this wide ranging treatment, Riccati equations can also be found in many diverse fields of physics from Bose-Einstein-condensates to cosmology. The book will appeal to graduate students and theoretical physicists interested in a consistent mathematical description of physical laws. (shrink)

Climatology is a paradigmatic complex systems science. Understanding the global climate involves tackling problems in physics, chemistry, economics, and many other disciplines. I argue that complex systems like the global climate are characterized by certain dynamical features that explain how those systems change over time. A complex system's dynamics are shaped by the interaction of many different components operating at many different temporal and spatial scales. Examining the multidisciplinary and holistic methods of climatology can help us better understand the nature (...) of complex systems in general. -/- Questions surrounding climate science can be divided into three rough categories: foundational, methodological, and evaluative questions. "How do we know that we can trust science?" is a paradigmatic foundational question (and a surprisingly difficult one to answer). Because the global climate is so complex, questions like "what makes a system complex?" also fall into this category. There are a number of existing definitions of `complexity,' and while all of them capture some aspects of what makes intuitively complex systems distinctive, none is entirely satisfactory. Most existing accounts of complexity have been developed to work with information-theoretic objects (signals, for instance) rather than the physical and social systems studied by scientists. -/- Dynamical complexity, a concept articulated in detail in the first third of the dissertation, is designed to bridge the gap between the mathematics of contemporary complexity theory (in particular the formalism of "effective complexity" developed by Gell-Mann and Lloyd [2003]) and a more general account of the structure of science generally. Dynamical complexity provides a physical interpretation of the formal tools of mathematical complexity theory, and thus can be used as a framework for thinking about general problems in the philosophy of science, including theories, explanation, and lawhood. -/- Methodological questions include questions about how climate science constructs its models, on what basis we trust those models, and how we might improve those models. In order to answer questions about climate modeling, it's important to understand what climate models look like and how they are constructed. Climate model families are significantly more diverse than are the model families of most other sciences (even sciences that study other complex systems). Existing climate models range from basic models that can be solved on paper to staggeringly complicated models that can only be analyzed using the most advanced supercomputers in the world. I introduce some of the central concepts in climatology by demonstrating how one of the most basic climate models might be constructed. I begin with the assumption that the Earth is a simple featureless blackbody which receives energy from the sun and releases it into space, and show how to model that assumption formally. I then gradually add other factors (e.g. albedo and the greenhouse effect) to the model, and show how each addition brings the model's prediction closer to agreement with observation. After constructing this basic model, I describe the so-called "complexity hierarchy" of the rest of climate models, and argue that the sense of "complexity" used in the climate modeling community is related to dynamical complexity. -/- With a clear understanding of the basics of climate modeling in hand, I then argue that foundational issues discussed early in the dissertation suggest that computation plays an irrevocably central role in climate modeling. "Science by simulation" is essential given the complexity of the global climate, but features of the climate system--the presence of non-linearities, feedback loops, and chaotic dynamics--put principled limits on the effectiveness of computational models. This tension is at the root of the staggering pluralism of the climate model hierarchy, and suggests that such pluralism is here to stay, rather than an artifact of our ignorance. Rather than attempting to converge on a single "best fit" climate model, we ought to embrace the diversity of climate models, and view each as a specialized tool designed to predict and explain a rather narrow range of phenomena. Understanding the climate system as a whole requires examining a number of different models, and correlating their outputs. This is the most significant methodological challenge of climatology. -/- Climatology's role contemporary political discourse raises an unusually high number of evaluative questions for a physical science. The two leading approaches to crafting policy surrounding climate change center on mitigation (i.e. stopping the changes from occurring) and adaptation (making post hoc changes to ameliorate the harm caused by those changes). Crafting an effective socio-political response to the threat of anthropogenic climate change, however, requires us to integrate multiple perspectives and values: the proper response will be just as diverse and pluralistic as the climate models themselves, and will incorporate aspects of both approaches. I conclude by offering some concrete recommendations about how to integrate this value pluralism into our socio-political decision making framework. (shrink)

We develop a general covariant categorical modeling theory of natural systems' behavior based on the fundamental functorial processes of representation and localization-globalization. In the second part of this study we analyze the semantic bidirectional process of localization-globalization. The notion of a localization system of a complex information structure bears a dual role: Firstly, it determines the appropriate categorical environment of base reference contexts for considering the operational modeling of a complex system's behavior, and secondly, it specifies the global (...) compatibility conditions of local contextual information. A localization system acts on the global information structure of a complex system, partitions it into sorts, and eventually, forces the consistent sheaf-theoretic fibering of the latter over the base category of commutative reference contexts. In this manner, the sheafification of the Spectrum functor of a complex information structure takes place by imposing on the uniform and homologous fibered structure of elements of the Spectrum presheaf the following two requirements of coherence in relation to the localization-globalization process: [i]. Compatibility of information under restriction from the global to the local level, and [ii]. Compatibility of information under extension from the local to the global level. Correspondingly, the options of local and global receive a concrete mathematical meaning with respect to a suitable notion of topology (categorical Grothendieck topology) defined on the base category of commutative reference contexts. Finally, the accurate functorial process modeling of a complex system's behavior, respecting the processes of representation and localization-globalization, is being effectuated by means of establishing a categorical dual equivalence between the category of complex information structures, and the topes of sheaves over the base category of partial or local information carriers, equipped with the categorical topology of epimorphosis families. (shrink)

This conference was devoted to the 80 years of the Copenhagen Interpretation, and to the question of the relevance of the Copenhagen interpretation for the present understanding of quantum mechanics. It is in this framework that fundamental questions raised by quantum mechanics, especially in information theory, were discussed throughout the conference. As has become customary in our series of conference in Växjö, we were glad to welcome a fruitful assembly of theoretical physicists, experimentalists, mathematicians and even philosophers interested (...) in the foundations of probability and physics. The nature of quantum fluctuations---in the form of Stochastic Electrodynamics or in other approaches to stochastic quantum mechanics---was also a central topic discussed during the conference, especially during debates. We should also mention talks on the completeness or incompleteness of quantum mechanics; on macroscopic quantum systems; on Bell's inequality, entanglement and experiments on quantum nonlocality (and locality); on Bohmian mechanics; on the connection between quantum mechanics and general relativity; on quantum probability; on quantum computing, quantum teleportation and quantum cryptography technologies; and more generally on the mathematical formalism of quantum mechanics and on the philosophical problems raised by its interpretations. (shrink)

Integrated Information Theory (IIT) is currently one of the most influential scientific theories of consciousness. Here, we focus specifically on a metaphysical aspect of the theory’s most recent version (IIT 4.0), what we may call its idealistic ontology, and its tension with a kind of realism about the external world that IIT also endorses. IIT 4.0 openly rejects the mainstream view that consciousness is generated by the brain, positing instead that consciousness is ontologically primary while the physical (...) domain is just “operational”. However, this philosophical position is presently underdeveloped and is not rigorously formulated in IIT, potentially leading to many misinterpretations and undermining its overall explanatory power. In the present paper we aim to address this issue. We argue that IIT’s idealistic ontology should be understood as a specific combination of phenomenal primitivism, reductionism regarding Φ-structures and complexes, and eliminativism about non-conscious physical entities. Having clarified this, we then focus on the problematic tension between IIT’s idealistic ontology and its simultaneous endorsement of realism, according to which there is some kind of external reality independent of our minds. After refuting three potential solutions to this theoretical tension, we propose the most plausible alternative: understanding IIT’s realism as an assertion of the existence of other experiences beyond one’s own, what we call a non-solipsistic idealist realism. We end with concluding remarks and future research avenues. (shrink)

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To (...) study the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery. We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics. The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources. The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well. Key Features: Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science Written by internationally leading researchers in the field of pure and applied logic Combines mathematical theory of modal logic and applications in artificial intelligence and computer science Numerous open problems for further research Well illustrated with pictures and tables. (shrink)

We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and wherethey are fundamentally different. We discuss and relate the basicnotions of both theories: Shannon entropy, Kolmogorov complexity, Shannon mutual informationand Kolmogorov (``algorithmic'') mutual information. We explainhow universal coding may be viewed as a middle ground betweenthe two theories. We consider Shannon's rate distortion theory, whichquantifies useful (in a certain sense) information.We use the communication (...) of information as our guiding motif, and we explain howit relates to sequential question-answer sessions. (shrink)

Making Sense of Inner Sense 'Terra cognita' is terra incognita. It is difficult to find someone not taken abackand fascinated by the incomprehensible but indisputable fact: there are material systems which are aware of themselves. Consciousness is self-cognizing code. During homo sapiens's relentness and often frustrated search for self-understanding various theories of consciousness have been and continue to be proposed. However, it remains unclear whether and at what level the problems of consciousness and intelligent thought can be resolved. Science's greatest (...) challenge is to answer the fundamental question: what precisely does a cognitive state amount to in physical terms? Albert Einstein insisted that the fundamental ideas of science are essentially simple and can be expressed in a language comprehensible to everyone. When one thinks about the complexities which present themselves in modern physics and even more so in the physics of life, one may wonder whether Einstein really meant what he said. Are we to consider the fundamental problem of the mind, whose understanding seems to lie outside the limits of the mind, to be essentially simple too? Knowledge is neither automatic nor universally deductive. Great new ideas are typically counterintuitive and outrageous, and connecting them by simple logical steps to existing knowledge is often a hard undertaking. The notion of a tensor was needed to provide the general theory of relativity; the notion of entropy had to be developed before we could get full insight into the laws of thermodynamics; the notice of information bit is crucial for communication theory, just as the concept of a Turing machine is instrumental in the deep understanding of a computer. To understand something, consciousness must reach an adequate intellectual level, even more so in order to understand itself. Reality is full of unending mysteries, the true explanation of which requires very technical knowledge, often involving notions not given directly to intuition. Even though the entire content and the results of this study are contained in the eight pages of the mathematical abstract, it would be unrealistic and impractical to suggest that anyone can gain full insight into the theory that presented here after just reading abstract. In our quest for knowledge we are exploring the remotest areas of the macrocosm and probing the invisible particles of the microcosm, from tiny neutrinos and strange quarks to black holes and the Big Bang. But the greatest mystery is very close to home: the greatest mystery is human consciousness. The question before us is whether the logical brain has evolved to a conceptual level where it is able to understand itself. (shrink)

Color has long been at home in the domains of classical art and aesthetics. However, with the introduction of computer art in Germany in the early 1960s, a new ‘rational theory’ of art, media and color emerged. Many believed this new ‘science’ of art would generate computer algorithms which would enable new media aesthetic ‘principles to be formulated mathematically’ — thus ending the lofty mystifications that have, for too long, been associated with Romantic notions about artwork and art-making. Although, (...) as German computer artist Herbert Franke noted, ‘Traditional aesthetic modes of expression are of little avail to the artist who works with technical systems, particularly computers’, I argue herein that the shifts in aesthetic theory brought about by the introduction of computer art are more complex than a clear-cut subsumption to mathematics, information theory or cybernetics. While the ‘Programming the Beautiful’ project that began in Europe in the 1960s — the three-fold rationalization of the artist, the artwork and color — has been largely realized, nonetheless, today we find ourselves seeped in the neo-Romanticization of new media art, the reglorification of the role of the artist, and new digital color — ironically, the exact opposite of what the project for rational art initially sought. (shrink)

It is argued that the truth status of emergent properties of complex adaptive systems models should be based on an epistemology of proof by constructive verification and therefore on the ontological axioms of a non-realist logical system such as constructivism or intuitionism. ‘Emergent’ properties of complex adaptive systems models create particular epistemological and ontological challenges. These challenges bear directly on current debates in the philosophy of mathematics and in theoretical computer science. CAS research, with its emphasis on computer simulation, (...) is heavily reliant on models which explore the entailments of Formal Axiomatic Systems. The incompleteness results of G¨odel, the incomputability results of Turing, and the Algorithmic Information Theory results of Chaitin, undermine a realist truth model of emergent properties. These same findings support the hegemony of epistemology over ontology and point to alternative truth models such as intuitionism, constructivism and quasi-empiricism. (shrink)

The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, computability (...) theory, and model theory, the text also contains numerous carefully graded exercises and is ideal for a first or refresher course. (shrink)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

We reconsider some classical natural semantics of integers in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self-enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained (...) by such effectivizations and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations . This contrasts with the well-known fact that usual Kolmogorov complexity does not depend on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (shrink)

This paper investigates the degree to which information theory, and the derived uses that make it work as a metaphor of our age, can be helpful in thinking about God’s immanence and transcendance. We ask when it is possible to say that a consciousness has to be behind the information we encounter. If God is to be thought about as a communicator of information, we need to ask whether a communication system has to pre-exist to the (...) divine and impose itself to God. If we want God to be Creator, and not someone who would work like a human being, ‘creating’ will mean sustaining in being as much the channel, the material system, as the message. Is information control? It seems that God’s actions are not going to be informational control of everything. To clarify the issue, we attempt to distinguish two kinds of ‘genialities’ in nature, as a way to evaluate the likelihood of God from nature. We investigate concepts and images of God, in terms of the history of ideas but also in terms of philosophical theology, metaphysics, and religious ontology. (shrink)

The following result is an approximation to the answer of the question of Kokorin about decidability of a quantifier-free theory of field of rational numbers. Let Q0 be a subset of the set of all rational numbers which contains integers 1 and −1. Let be a set containing Q0 and closed by the functions of addition, subtraction and multiplication. For example coincides with Q0 if Q0 is the set of all binary rational numbers or the set of all decimal (...) rational numbers. It is clear that , where Z is the set of all integers and Q is the set of all rational numbers. A negationless theory uses only conjunction and disjunction as logical connectives. Let T be a quantifier-free negationless elementary theory of signature , where Pol is the list of all polynomials with rational coefficients from Q0 in which exponent of the polynomials and rational coefficients are written in binary number system. Theorem 1. Theory T is NP-hard and if is everywhere dense then the theory T is decidable by an algorithm which belongs to EXPTIME. The set of all rational numbers or the set of all binary rational numbers may be taken instead of . The quantifier-free negationless theory of the field of rational numbers may be regarded as a base of constructive mathematics. (shrink)

The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the present (...) such as Fermat’s last theorem, four-color theorem as well as its new-formulated generalization as “four-letter theorem”, Poincaré’s conjecture, “P vs NP” are considered over again, from and within the new-founding conceptual reference frame of information, as illustrations. Simple or crucially simplifying solutions and proofs are demonstrated. The link between the consistent completeness of the system mathematics-physics on the ground of information and all the great mathematical problems of the present (rather than the enumerated ones) is suggested. (shrink)

This insight to art came from chess composition concentrating art in a very dense form. To identify and mathematically assess the uniqueness is the key applicable to other areas eg. computer programming. Maximization of uniqueness is minimization of entropy that coincides as well as goes beyond Information Theory (Shannon, 1948). The reusage of logic as a universal principle to minimize entropy, requires simplified architecture and abstraction. Any structures (e.g. plugins) duplicating or dividing functionality increase entropy and so unreliability (...) (eg. British Airways IT system). The ideas here were verified by my chess compositions, art works and complex information system as an author of each co uk, and were presented at conferences in Santorini, Adelaide, Geneva, Daejon and virtually. (shrink)

The scientific study of consciousness, also referred to as consciousness science, is a young scientific field devoted to understanding how conscious experiences and the brain relate. It comprises a host of theories, experiments, and analyses that aim to investigate the problem of consciousness empirically, theoretically, and conceptually. This thesis addresses some of the questions that arise in these investigations from a formal and mathematical perspective. These questions concern theories of consciousness, experimental paradigms, methodology, and artificial consciousness. -/- Regarding theories of (...) consciousness, the thesis contributes to the understanding of the mathematical structure that some of the formal theories in the field propose. The work presented here targets the theory of consciousness known as Integrated Information Theory (IIT) and the neuroscientific theory known as Predictive Processing Theory or Free Energy Principle in its Active Inference form (AI-PP). The thesis provides axiomatic definitions of the mathematical structures that constitute these theories, and uses these definitions to address some of the open questions surrounding the theories. For AI-PP, this includes a rigorous derivation of the formula for Active Inference via Free Energy minimisation and a proof of compositionality of Free Energy. For IIT, this includes resolutions of some of the criticisms of IIT's formal scope and applications, but also the identification of new issues that concern the formalism and its derivation. When possible, the definitions are provided in the mathematical framework of category theory. -/- Regarding experiments, the thesis addresses the main paradigm for testing and falsifying theories of consciousness currently applied in the field. This paradigm consists of comparing the conscious experience that a theory predicts with the conscious experience that is inferred from behavioural data or report by use of measures of consciousness. The thesis provides a formal model of this paradigm and shows that under a certain condition—if inference and prediction are independent—, any minimally informative theory of consciousness can always be falsified. This is deeply problematic since the field’s reliance on report or behaviour to infer conscious experiences, in conjunction with the general structure of most contemporary theories of consciousness, implies such independence. This observation provides the exact formal underpinning of the well-known unfolding argument. The thesis analyses the origin of the problem and identifies precisely which changes are required to avoid this problem in future research. The thesis furthermore shows that the problem of falsifying theories of consciousness, and of empirical comparisons of theories of consciousness more generally, follows from a pervasive closure paradigm in consciousness science, that consists of taking a neuroscientific account of the brain as input to a theory of consciousness, so as to explain what consciousness is, without allowing for modifications or adaptations of the neuroscientific account that would accommodate consciousness as part of the brain's functioning. As is shown in the thesis, this paradigm has implications that point to a fundamental need of revision. -/- Regarding methodological and conceptual questions, the thesis contributes to the foundations of structural research in consciousness science. Structural research aims to use mathematical structures or mathematical spaces, instead of verbal descriptions or simple categorisations, to represent conscious experiences scientifically, for example when building theories of consciousness, or when exploring new empirical avenues to measure consciousness. Despite considerable advances in this realm, there was, prior to this thesis, no explicit definition of what a mathematical structure of conscious experience should be; that is, how the attribution of mathematical structure to conscious experiences should be systematically understood. Perhaps the most important contribution of this thesis to the field is to propose such a definition. The definition, a structural concept, extends existing approaches wherever available, and provides a basis for developing a common formal language to study consciousness, bridging developments as far apart as psychophysics and phenomenology. In addition, and independently of this proposal, the thesis offers a critical analysis of which metaphysical premises need to be presumed in structural research, whether the use of particular formal tools (such as structure-preserving mappings or homomorphisms) is justified, and how structural theories of consciousness could otherwise be built in the first place. An attempt to expand the results from consciousness to more general problems in philosophy of science is made in the context of the well-known Newman problem. -/- Regarding the question of artificial consciousness—can AI feel?—, the thesis contributes two results that take the form of no-go theorems, as known from physics. The first no-go theorem shows that if consciousness is relevant for the temporal evolution of a system's states—if it is dynamically relevant—, then contemporary AI systems cannot be conscious. That is because AI systems run on CPUs, GPUs, TPUs or other processors which have been designed and verified to adhere to computational dynamics that systematically preclude or suppress deviations. The second no-go theorem is situated in the context of computational functionalism, a view which posits that consciousness is a computation. The theorem shows that if computational functionalism holds true, consciousness cannot be a Turing computation. Rather, it must be a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation. -/- This thesis is part of a global effort to pioneer a mathematical perspective in consciousness science, now called Mathematical Consciousness Science. The hope behind the research carried out in this PhD is to illustrate the power and usefulness of mathematical approaches in different areas of consciousness science, and in doing so, to lay the foundations for future mathematical work that complements and supports empirical and theoretical work in the further development of this exciting field. (shrink)

Open peer commentary on the article “Info-computational Constructivism and Cognition” by Gordana Dodig-Crnkovic. Upshot: Dodig-Crnkovic’s “info-computational constructivism” (IC), as an essential part of a constructivist approach, needs integration with the logical, mathematical and physical evidence coming from quantum field theory (QFT) as the fundamental physics of the emergence of “complex systems” in all realms of natural sciences.

This short paper is meant to be an introduction to the ‘Letter to Alan Turing’ that follows it. It summarizes some basic ideas in information theory and very informally hints at their mathematical properties. In order to introduce Turing’s two main theoretical contributions, in Theory of Computation and in Morphogenesis, the fundamental divide between discrete vs. continuous structures in mathematics is presented, as it is also a divide in his scientific life. The reader who is familiar (...) with these notions, and is convinced that they are relevant in the mathematical understanding of phenomena, may skip this introduction and go directly to the Letter. (shrink)