A threat to humanity portending the end of our species lurks in the cold recesses of space. Our only hope is an eleven-year-old boy. Celebrating the long-awaited release of the movie adaptation of Orson Scott Card’s novel about highly trained child geniuses fighting a race of invading aliens, this collection of original essays probes key philosophical questions raised in the narrative, including the ethics of child soldiers, politics on the internet, and the morality of war and genocide. Original essays dissect (...) the diverse philosophical questions raised in Card’s best-selling sci-fi classic, winner of the Nebula and Hugo Awards and which has been translated in 29 languages Publication coincides with planned release of major motion picture adaptation of _Ender’s Game_ starring Asa Butterfield and Harrison Ford Treats a wealth of core contemporary issues in morality and ethics, including child soldiers, the best kind of education and the use and misuse of global communications for political purposes A stand-out addition to the Blackwell Philosophy and Pop Culture series. (shrink)

The theory of logical gates in quantum computation has inspired the development of new forms of quantum logic where the meaning of a formula is identified with a density operator and the logical connectives are interpreted as operations defined in terms of quantum gates. We show some relations between the Bertini gate and many valued connectives by probability values. On this basis, one can deal with quantum circuits as expressions in an algebraic environment such as product many (...) valued algebra for combinational circuits. As can be expected, we show that the compositional logic characterized by the qubit semantics is stronger than the compositional Łukasiewicz quantum computational logic by a counterexample. But, in the holistic case, we conjecture that they can characterize the same logic. (shrink)

Field-Programmable Gate Arrays (FPGAs) have emerged as an attractive means of implementing logic circuits, providing instant manufacturing turnaround and negligible prototype costs. They hold the promise of replacing much of the VLSI market now held by mask-programmed gate arrays. FPGAs offer an affordable solution for customized VLSI, over a wide variety of applications, and have also opened up new possibilities in designing reconfigurable digital systems. Field-Programmable Gate Arrays discusses the most important aspects of FPGAs in a textbook manner. It (...) provides the reader with a focused view of the key issues, using a consistent notation and style of presentation. It provides detailed descriptions of commercially available FPGAs and an in-depth treatment of the FPGA architecture and CAD issues that are the subjects of current research. The material presented is of interest to a variety of readers, including those who are not familiar with FPGA technology, but wish to be introduced to it, as well as those who already have an understanding of FPGAs, but who are interested in learning about the research directions that are of current interest. (shrink)

The living mycelium networks are capable of efficient sensorial fusion over very large areas and distributed decision making. The information processing in the mycelium networks is implemented via propagation of electrical and chemical signals en pair with morphological changes in the mycelium structure. These information processing mechanisms are manifested in experimental laboratory findings that show that the mycelium networks exhibit rich dynamics of neuron-like spiking behaviour and a wide range of non-linear electrical properties. On an example of a single real (...) colony of _Aspergillus niger_, we demonstrate that the non-linear transformation of electrical signals and trains of extracellular voltage spikes can be used to implement logical gates and circuits. The approaches adopted include numerical modelling of excitation propagation on the mycelium network, representation of the mycelium network as a resistive and capacitive network and an experimental laboratory study on mining logical circuits in mycelium bound composites. (shrink)

Vector logic is a mathematical model of the propositional calculus in which the logical variables are represented by vectors and the logical operations by matrices. In this framework, many tautologies of classical logic are intrinsic identities between operators and, consequently, they are valid beyond the bivalued domain. The operators can be expressed as Kronecker polynomials. These polynomials allow us to show that many important tautologies of classical logic are generated from basic operators via the operations called Type (...) I and Type II products. Finally, it is described a matrix version of the Fredkin gate that extends its properties to the many-valued domain, and it is proved that the filtered Fredkin operators are second degree Kronecker polynomials that cannot be generated by Type I or Type II products. (shrink)

This book provides a general survey of the main concepts, questions and results that have been developed in the recent interactions between quantum information, quantum computation and logic. Divided into 10 chapters, the books starts with an introduction of the main concepts of the quantum-theoretic formalism used in quantum information. It then gives a synthetic presentation of the main “mathematical characters” of the quantum computational game: qubits, quregisters, mixtures of quregisters, quantum logical gates. Next, the book investigates the (...) puzzling entanglement-phenomena and logically analyses the Einstein–Podolsky–Rosen paradox and introduces the reader to quantum computational logics, and new forms of quantum logic. The middle chapters investigate the possibility of a quantum computational semantics for a language that can express sentences like “Alice knows that everybody knows that she is pretty”, explore the mathematical concept of quantum Turing machine, and illustrate some characteristic examples that arise in the framework of musical languages. The book concludes with an analysis of recent discussions, and contains a Mathematical Appendix which is a survey of the definitions of all main mathematical concepts used in the book. (shrink)

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. The basic algebraic properties of this system have been studied in Dalla Chiara et al. (Foundations of Physics 39(6):559–572, 2009), where we have introduced the notion of Shi-Aharonov quantum computational structure. In this paper we propose an algebraic abstraction from the Hilbert-space quantum computational structures, by introducing the notion of Toffoli-Hadamard algebra. From an intuitive point (...) of view, such abstract algebras represent a natural quantum generalization of both classical and fuzzy-like structures. (shrink)

In this paper we relax the assumption that the logical constants of ordinary first-order logic be linearly ordered. As a consequence, we shall have formulas involving not only partially ordered quantifiers, but also partially ordered connectives. The resulting language, called the language of informational independence will be given an interpretation in terms of games of imperfect information. The II-logic will be seen to have some interesting properties: It is very natural to define in this logic two negations, (...) weak negation as failure to verify a sentence, and strong negation as the existence of a falsifying strategy: One can express in this logic complete problems of finite structures, like the non-connectedness and 3-colorability of finite graphs, the satisfiability problem for Boolean circuits built up from NAND-gates, etc. (shrink)

In his 2018 essay Down to Earth, the French philosopher Bruno Latour proposes a hypothesis that connects a number of contemporary issues, ranging from climate denialism to deregulation and growing inequality. While his hypothesis, namely that the elites act as if they live in another world and are leaving the rest of the world behind, might seem like a conspiracy theory, I will argue that there is a way to make sense of it. To do so, I will turn to (...) two other authors, Timothy Mitchell and Shoshana Zuboff, to highlight the kind of logic that Latour seems to have in mind. In the final section, I will propose to capture the commonalities of these authors through the concept of shifting reciprocities and will return to Latour’s political plea to define one’s territories, reinterpreted as reciprocities. (shrink)

Rice Combinational and Sequential Logic This text provides a guide to combinational and sequential logic, introducing students to the basic concepts then progressing to HND/first year undergraduate level. It has a highly practical emphasis, enabling the reader to simulate, build and test the circuits discussed in the text. Electronics Workbench files are provided for simulation, while easy-to-use XPLA software and specially designed hardware encourage the reader to build and test the circuits using programmable logic. The text itself (...) contains many self-assessment questions, complete with detailed answers, allowing students to test themselves as they learn. No previous experience of the topic is required and an abundance of practical examples helps students to apply the basic principles. The accompanying CD-ROM provides the XPLA development system software and Electronics Workbench files, as well as the Xilinx Webpack development system and 'walkthrough'. Hardware for Programmable Logic experiments can either be purchased or built following instructions from the text. Altogether, the text, software and hardware provide an interactive and stimulating teaching and learning resource. F. (shrink)

The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to know­ledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and (...) class='Hi'>logic gates, computer programming languages, probability theory, and database queries. An analysis is offered of shortcomings that Boolean logic has in terms of potential uses in know­ledge organization. (shrink)

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Aharonov quantum computational structure. We show that the quotient of this structure is isomorphic to a structure based on a particular set of complex numbers (the closed disc with center \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(\frac{1}{2},\frac{1}{2})$\end{document} and radius (...) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\frac{1}{2}$\end{document} ). (shrink)

One of the main problems in the the study of Parmenides' poem is establishing the meaning of e0/00nai, 'to be'. Scholars often simply take it to mean: 'to exist', 'to be the case', 'to be so', or regard it as a copula. It's better to start by fathoming what Parmenides himself has to say about to be and about Being. This cannot be done without recognizing the logical pattern in his poem. Another main problem is: what does not-Being mean? Is (...) the so-called Doxa - as not-Being - a non-existing, hallucinatory world, an illusion, a fata morgana? Or is it only a detector of lies? In the present work the view will be advocated that the Doxa offers the description of a really existing world. A specific merit of this book is that all the problems involved will be examined in continuous debate with what scholars have offered as solutions so far. (shrink)

We introduce a new structure, the critical multi-cubic lattice. Notably the critical multi-cubic lattice is the first true generalization of the cubic lattice to higher dimensional spaces. We then introduce the notion of a homomorphism in the category of critical multi-cubic lattices, compute its automorphism group, and construct a Hilbert space over which we represent the group. With this unitary representation, we re-derive the generalized Pauli matrices common in quantum computation while also defining an algebraic framework for an infinite system (...) of qudits. We also briefly explore the critical multi-cubic lattice as a novel implication algebra serving as a logical framework for qudit gates. (shrink)

The present study proposes a valorization of the work of professor and philosopher Ioan Biriş. The statistics of his books and studies, their distribution by areas of interest, and especially the ideas in his work confirm the need for philosophy in the Romanian cultural life. As a whole, his philosophical endeavor is based on the concept of totality. Thus in the Hegelian spirit, Ioan Biriş successfully convinces us that the logical may exceed the limits of formal exercise and become the (...) organon of philosophy. In this capacity, the logical may operate on the real and valorize the multiple relationships between identity and difference. His books Filosofia și logica științelor sociale, Totalitate, sistem, holon, Rolul imaginarului în cunoașterea științifică, Istorie şi cultură, as well as a series of studies among which let me mention: “L’identité symbolique et la logique partitive des valeurs spirituelles”, “On the logic of religious terms”, “Le rapport identite-difference et la conjonction collective. Aspects logiques”, clearly prove the author’s capacity to integrate existential, religious, cognitive and axiological issues into a unitary vision. As Noica would say, he succeeded to enter the spirit’s life thorough the intellect’s gate. (shrink)

Neuroconstructivism, Vol. 1: How the Brain Constructs Cognition implies that brain functioning depends on biofeedback and ecological trajectories. Using the building blocks of Boolean algebra known as logic gates and models of distributed control systems, I suggest that levels of regulatory states are responsible for optimal, pathological, and developmental processes. I include the impact of regulatory and nonregulatory functions on structural development.

Logics are like shadows on a wall; to understand why they dance as they do, and how they can be made to move differently, one needs to look at the mathematical structures from which they can be projected. That is a methodology that has long proven its value for classical and other forms of deductive inference; this book manifests its pertinence to logics of uncertain qualitative reasoning. It draws together and refines work from the literature on preferential and other quite (...) different semantics for such reasoning and then, in its central chapter, integrates the leading ideas from them into a single multi-dimensional semantics. It enters new territory with investigations of interpolation and qualitative independence in non-monotonic contexts as well as connections between non-monotonic logic and neuroscience, specifically with Edelman's theory of organization of the brain. Finally, it proposes novel applications such as equational modellings for contrary-to-duty normative reasoning and mathematical analyses of some kinds of casuistic reasoning in the Talmudic tradition. Profusely signposted at every turn, the volume is accessible to readers equipped with a modicum of set theory and abstract algebra. Visitors to the area can come in by the front gate and work their way, in various orders, through as much of the garden as strikes their fancy; specialists will enter at Chap. 11 or at whatever special topic interests them, well assured that they can easily backtrack to whatever bits and pieces are needed from what they skipped. A volume with a clear vision, a book to return to many times." (David Makinson). (shrink)

In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincaré irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem.

Originating from work in operations research the cutting plane refutation systemCP is an extension of resolution, where unsatisfiable propositional logic formulas in conjunctive normal form are recognized by showing the non-existence of boolean solutions to associated families of linear inequalities. Polynomial sizeCP proofs are given for the undirecteds-t connectivity principle. The subsystemsCP q ofCP, forq≥2, are shown to be polynomially equivalent toCP, thus answering problem 19 from the list of open problems of [8]. We present a normal form theorem (...) forCP 2-proofs and thereby for arbitraryCP-proofs. As a corollary, we show that the coefficients and constant terms in arbitrary cutting plane proofs may be exponentially bounded by the number of steps in the proof, at the cost of an at most polynomial increase in the number of steps in the proof. The extensionCPLE +, introduced in [9] and there shown top-simulate Frege systems, is proved to be polynomially equivalent to Frege systems. Lastly, since linear inequalities are related to threshold gates, we introduce a new threshold logic and prove a completeness theorem. (shrink)

Engaging Ludwig Wittgenstein as 'philosophical hand-maid' (as opposed to 'metaphysical gate-keeper'), this book subjects to critique both traditional realist and post-modern constructivist perspectives as it examines how the nature and role of metaphor-making at the creative edge of language casts light on the God-language-world relationship.

We introduce a generalization of MV algebras motivated by the investigations into the structure of quantum logical gates. After laying down the foundations of the structure theory for such quasi-MV algebras, we show that every quasi-MV algebra is embeddable into the direct product of an MV algebra and a “flat” quasi-MV algebra, and prove a completeness result w.r.t. a standard quasi-MV algebra over the complex numbers.

In this transdisciplinary article which stems from philosophical considerations (that depart from phenomenology—after Merleau-Ponty, Heidegger and Rosen—and Hegelian dialectics), we develop a conception based on topological (the Moebius surface and the Klein bottle) and geometrical considerations (based on torsion and non-orientability of manifolds), and multivalued logics which we develop into a unified world conception that surmounts the Cartesian cut and Aristotelian logic. The role of torsion appears in a self-referential construction of space and time, which will be further related (...) to the commutator of the True and False operators of matrix logic, still with a quantum superposed state related to a Moebius surface, and as the physical field at the basis of Spencer-Brown’s primitive distinction in the protologic of the calculus of distinction. In this setting, paradox, self-reference, depth, time and space, higher-order non-dual logic, perception, spin and a time operator, the Klein bottle, hypernumbers due to Musès which include non-trivial square roots of ±1 and in particular non-trivial nilpotents, quantum field operators, the transformation of cognition to spin for two-state quantum systems, are found to be keenly interwoven in a world conception compatible with the philosophical approach taken for basis of this article. The Klein bottle is found not only to be the topological in-formation for self-reference and paradox whose logical counterpart in the calculus of indications are the paradoxical imaginary time waves, but also a classical-quantum transformer (Hadamard’s gate in quantum computation) which is indispensable to be able to obtain a complete multivalued logical system, and still to generate the matrix extension of classical connective Boolean logic. We further find that the multivalued logic that stems from considering the paradoxical equation in the calculus of distinctions, and in particular, the imaginary solutions to this equation, generates the matrix logic which supersedes the classical logic of connectives and which has for particular subtheories fuzzy and quantum logics. Thus, from a primitive distinction in the vacuum plane and the axioms of the calculus of distinction, we can derive by incorporating paradox, the world conception succinctly described above. (shrink)

The integrated information theory is a promising theory of consciousness. However, there are several problems with IIT's axioms and postulates. Moreover, IIT entails that some twodimensional grids of identical logic gates have more consciousness than humans. Many have found this prediction to be implausible, and as will be argued here, this prediction also exacerbates the so-called 'hard problem of consciousness'. Recently, it has been argued that if we treat the phenomenological aspects of consciousness as an illusion, we can (...) avoid the hard problem altogether by replacing it with the more tractable illusion problem: the problem of explaining how introspection systematically misrepresents experiences as having phenomenology. IIT is intended to be a theory of the phenomenological aspects of consciousness. However, it is possible to reformulate the axioms and postulates of IIT consistently with illusionism. Here it is argued that the resulting theory -- illusionist integrated information theory -- removes several problems for IIT including the hard problem and the logic gate problem, and also enables meaningful progress for illusionists on solving the illusion problem. (shrink)

The paradox of material implication has remained unresolved since antiquity because it was believed that the nature of implication was entailment. The article shows that this nature is opposition and therefore the name "implication" should be replaced with the name "competition". A solution to the paradox is provided along with appropriate changes in nomenclature, the addition of connectives and the postulate that the biconditional take over the role of the previous implication. In addition, changes to the nomenclature of logic (...) gates reflecting the competition in electronics are proposed. (shrink)

I address whether neural networks perform computations in the sense of computability theory and computer science. I explicate and defend
the following theses. (1) Many neural networks compute—they perform computations. (2) Some neural networks compute in a classical way.
Ordinary digital computers, which are very large networks of logic gates, belong in this class of neural networks. (3) Other neural networks
compute in a non-classical way. (4) Yet other neural networks do not perform computations. Brains may well fall into this last (...) class. (shrink)

The “Slicing Problem” is a thought experiment that raises questions for substrate-neutral computational theories of consciousness, including those that specify a certain causal structure for the computation like Integrated Information Theory. The thought experiment uses water-based logic gates to construct a computer in a way that permits cleanly slicing each gate and connection in half, creating two identical computers each instantiating the same computation. The slicing can be reversed and repeated via an on/off switch, without changing the amount (...) of matter in the system. The question is what do different computational theories of consciousness believe is happening to the number and nature of individual conscious units as this switch is toggled. Under a token interpretation, there are now two discrete conscious entities; under a type interpretation, there may remain only one. Both interpretations lead to different implications depending on the adopted theoretical stance. Any route taken either allows mechanisms for “consciousness-multiplying exploits” or requires ambiguous boundaries between conscious entities, raising philosophical and ethical questions for theorists to consider. We discuss resolutions under different theories of consciousness for those unwilling to accept consciousness-multiplying exploits. In particular, we specify three features that may help promising physicalist theories to navigate such thought experiments. (shrink)

Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and intermediate-scale systems are on the horizon, capable of calculating numeric results or simulating physical systems far beyond what humans can do by hand. However, to be commercially viable, they must surpass what our wildly successful, highly advanced classical computers can already do. At the same time, those classical (...) computers continue to advance, but those advances are now constrained by thermodynamics, and will soon be limited by the discrete nature of atomic matter and ultimately quantum effects. Technological advances benefit both quantum and classical machinery, altering the competitive landscape. Can we build quantum computing systems that out-compute classical systems capable of some \(10^{30}\) logic gates per month? This article will discuss the interplay in these competing and cooperating technological trends. (shrink)

Quasi MV-algebras are a generalization of MV-algebras and they are motivated by the investigation of the structure of quantum logical gates. In the first part, we present relationships between ideals, weak ideals, congruences, and perfectness within MV-algebras and quasi MV-algebras, respectively. To achieve this goal, we provide a comprehensive characterization of congruence relations of a quasi MV-algebra \({\mathcal {A}}\) concerning the congruence relations of its MV-algebra of regular elements of \({\mathcal {A}}\), along with specific equivalence relations concerning the complement (...) of the set of regular elements. In the second part, we concentrate on perfect quasi MV-algebras. We present their representation by symmetric quasi \(\ell \) -groups, a special kind of quasi \(\ell \) -groups. Moreover, we establish a categorical equivalence of the category of perfect quasi MV-algebras, the category of _n_-perfect quasi MV-algebras, and the category of symmetric quasi \(\ell \) -groups. (shrink)

The history of philosophy is a history of moral circle expansion. This history correlates with a history of expansionism about consciousness. Recently, expansionism about consciousness has exploded: to invertebrates, to plants, to logic gates, and to fundamental entities. The last of these expansions stems from a surge of interest in panpsychism. In an exploratory spirit, this paper considers some largely uncharted territory: the ethical implications of panpsychism. Our conclusion is that while panpsychism probably does significantly expand our moral (...) circle, it's also probably short on anything of practical significance. (shrink)

In this article we present a new kind of computing device that uses biochemical reactions networks as building blocks to implement logic gates. The architecture of a computing machine relies on these generic and composable building blocks, computation units, that can be used in multiple instances to perform complex boolean functions. Standard logical operations are implemented by biochemical networks, encapsulated and insulated within synthetic vesicles called protocells. These protocells are capable of exchanging energy and information with each other (...) through transmembrane electron transfer. In the paradigm of computation we propose, protoputing, a machine can solve only one problem and therefore has to be built specifically. Thus, the programming phase in the standard computing paradigm is represented in our approach by the set of assembly instructions that directs the wiring of the protocells that constitute the machine itself. To demonstrate the computing power of protocellular machines, we apply it to solve a NP-complete problem, known to be very demanding in computing power, the 3-SAT problem. We show how to program the assembly of a machine that can verify the satisfiability of a given boolean formula. Then we show how to use the massive parallelism of these machines to verify in less than 20 min all the valuations of the input variables and output a fluorescent signal when the formula is satisfiable or no signal at all otherwise. (shrink)

The importance of electrical signalling in bacteria is an emerging paradigm. Bacillus subtilis biofilms exhibit electrical communication that regulates metabolic activity and biofilm growth. Starving cells initiate oscillatory extracellular potassium signals that help even the distribution of nutrients within the biofilm and thus help regulate biofilm development. Quorum sensing also regulates biofilm growth and crucially there is convergence between electrical and quorum sensing signalling axes. This makes B. subtilis an interesting model for cell signalling research. SpoOF is predicted to act (...) as a logic gate for signalling pathway convergence, raising interesting questions about the functional nature of this gate and the relative importance of these disparate signals on biofilm behaviour. How is an oscillating signal integrated with a quorum signal? The model presented offers rich opportunities for future experimental and theoretical modelling research. The importance of direct cell‐to‐cell electrical signalling in prokaryotes, so characteristic of multicellular eukaryotes, is also discussed. (shrink)

In this article we present a new kind of computing device that uses biochemical reactions networks as building blocks to implement logic gates. The architecture of a computing machine relies on these generic and composable building blocks, computation units, that can be used in multiple instances to perform complex boolean functions. Standard logical operations are implemented by biochemical networks, encapsulated and insulated within synthetic vesicles called protocells. These protocells are capable of exchanging energy and information with each other (...) through transmembrane electron transfer. In the paradigm of computation we propose, protoputing, a machine can solve only one problem and therefore has to be built specifically. Thus, the programming phase in the standard computing paradigm is represented in our approach by the set of assembly instructions that directs the wiring of the protocells that constitute the machine itself. To demonstrate the computing power of protocellular machines, we apply it to solve a NP-complete problem, known to be very demanding in computing power, the 3-SAT problem. We show how to program the assembly of a machine that can verify the satisfiability of a given boolean formula. Then we show how to use the massive parallelism of these machines to verify in less than 20 min all the valuations of the input variables and output a fluorescent signal when the formula is satisfiable or no signal at all otherwise. (shrink)

I show that the indeterminacy problem for computational structuralists is in fact far more problematic than even the harshest critic of structuralism has realised; it is not a bullet which can be bitten by structuralists as previously thought. Roughly, this is because the structural indeterminacy of logic-gates such as AND/OR is caused by the structural identity of the binary computational digits 0/1 themselves. I provide a proof that pure computational structuralism is untenable because structural indeterminacy entails absurd consequences (...) - namely, that there is only one binary computational digit. I conclude that accounting for individuation is a more important desiderata for a theory of computation than even that of triviality. -/- . (shrink)

Synthetic biology is a field of research that concentrates on the design, construction, and modification of new biomolecular parts and metabolic pathways using engineering techniques and computational models. By employing knowledge of operational pathways from engineering and mathematics such as circuits, oscillators, and digital logic gates, it uses these to understand, model, rewire, and reprogram biological networks and modules. Standard biological parts with known functions are catalogued in a number of registries (e.g. Massachusetts Institute of Technology Registry of (...) Standard Biological Parts). Biological parts can then be selected from the catalogue and assembled in a variety of combinations to construct a system or pathway in a microbe. Through the innovative re-engineering of biological circuits and the optimization of certain metabolic pathways, biological modules can be designed to reprogram organisms to produce products or behaviors. Synthetic biology is what is known as a “platform technology”. That is, it generates highly transferrable theoretical models, engineering principles, and know-how that can be applied to create potential products in a wide variety of industries. Proponents suggest that applications of synthetic biology may be able to provide scientific and engineered solutions to a multitude of worldwide problems from health to energy. Synthetic biology research has already been successful in constructing microbial products which promise to offer cheaper pharmaceuticals such as the antimalarial synthetic drug artemisinin, engineered microbes capable of cleaning up oil spills, and the engineering of biosensors that can detect the presence of high concentrations of arsenic in drinking water. One of the potential benefits of synthetic biology research is in its application to biofuel production. It is this application which is the focus of this entry. The term “biofuel” has referred generally to all liquid fuels that are sourced from plant or plant byproducts and are used for energy necessary for transportation vehicles (Thompson 2012). Biofuels that are produced using synthetic biological techniques re-engineer microbes into biofuel factories are a subset of these. (shrink)

I argue that there are different orders of mechanisms with different constitutive relevance and individuation conditions. In common first-order mechanistic explanations, constitutive relevance norms are captured by the matched-interlevel-experiments condition (Craver et al. (2021) Synthese 199:8807–8828). Regarding individuation, we say that any two mechanisms are of the same type when they have the same concrete components performing the same activities in the same arrangement. By contrast, in higher-order mechanistic explanations, we formulate the decompositions in terms of generalized basic components (GBCs). (...) These GBCs (e.g., logic gates) possess causal properties that are common to a set of physical systems. Mechanistic explanations formulated in terms of GBCs embody the epistemic value of horizontal integration, which aims to explain as many phenomena as possible with a minimal amount of abstract components (Wajnerman Paz (2017a) Philos Psychol 30:213–234). Two higher-order mechanisms are of the same type when they share all the same GBCs, and they are organized as performing the same activities with the same interactions. I use this notion of mechanistic order to enhance the mechanistic account of computation (MAC) and provide an account of the epistemic norms of computational explanation and the nature of medium-independent functional properties and mechanisms. Finally, I use these new conceptual tools to address four criticisms of the MAC. (shrink)

The characteristic holistic features of the quantum theoretic formalism and the intriguing notion of entanglement can be applied to a field that is far from microphysics: logical semantics. Quantum computational logics are new forms of quantum logic that have been suggested by the theory of quantum logical gates in quantum computation. In the standard semantics of these logics, sentences denote quantum information quantities: systems of qubits (quregisters) or, more generally, mixtures of quregisters (qumixes), while logical connectives are interpreted (...) as special quantum logical gates (which have a characteristic reversible and dynamic behavior). In this framework, states of knowledge may be entangled, in such a way that our information about the whole determines our information about the parts; and the procedure cannot be, generally, inverted. In spite of its appealing properties, the standard version of the quantum computational semantics is strongly “Hilbert-space dependent”. This certainly represents a shortcoming for all applications, where real and complex numbers do not generally play any significant role (as happens, for instance, in the case of natural and of artistic languages). We propose an abstract version of quantum computational semantics, where abstract qumixes, quregisters and registers are identified with some special objects (not necessarily living in a Hilbert space), while gates are reversible functions that transform qumixes into qumixes. In this framework, one can give an abstract definition of the notions of superposition and of entangled pieces of information, quite independently of any numerical values. We investigate three different forms of abstract holistic quantum computational logic. (shrink)

Fluid neural networks can be used as a theoretical framework for a wide range of complex systems as social insects. In this article we show that collective logical gates can be built in such a way that complex computation can be possible by means of the interplay between local interactions and the collective creation of a global field. This is exemplified by a NOR gate. Some general implications for ant societies are outlined. ©.

An astonishingly diverse biomolecular circuitry orchestrates the functioning machinery underlying every living cell. These biomolecules and their circuits have been engineered not only for various industrial applications but also to perform other atypical functions that they were not evolved for—including computation. Various kinds of computational challenges, such as solving NP‐complete problems with many variables, logical computation, neural network operations, and cryptography, have all been attempted through this unconventional computing paradigm. In this review, we highlight key experiments across three different ‘‘eras’’ (...) of molecular computation, beginning with molecular solutions, transitioning to logic circuits and ultimately, more complex molecular networks. We also discuss a variety of applications of molecular computation, from solving NP‐hard problems to self‐assembled nanostructures for delivering molecules, and provide a glimpse into the exciting potential that molecular computing holds for the future. Also see the video abstract here: https://youtu.be/9Mw0K0vCSQw. (shrink)

Writings by a thinker—a psychiatrist, a philosopher, a cybernetician, and a poet—whose ideas about mind and brain were far ahead of his time. Warren S. McCulloch was an original thinker, in many respects far ahead of his time. McCulloch, who was a psychiatrist, a philosopher, a teacher, a mathematician, and a poet, termed his work “experimental epistemology.” He said, “There is one answer, only one, toward which I've groped for thirty years: to find out how brains work.” Embodiments of Mind, (...) first published more than fifty years ago, teems with intriguing concepts about the mind/brain that are highly relevant to recent developments in neuroscience and neural networks. It includes two classic papers coauthored with Walter Pitts, one of which applies Boolean algebra to neurons considered as gates, and the other of which shows the kind of nervous circuitry that could be used in perceiving universals. These first models are part of the basis of artificial intelligence. Chapters range from “What Is a Number, that a Man May Know It, and a Man, that He May Know a Number,” and “Why the Mind Is in the Head,” to “What the Frog's Eye Tells the Frog's Brain” (with Jerome Lettvin, Humberto Maturana, and Walter Pitts), “Machines that Think and Want,” and “A Logical Calculus of the Ideas Immanent in Nervous Activity” (with Walter Pitts). Embodiments of Mind concludes with a selection of McCulloch's poems and sonnets. This reissued edition offers a new foreword and a biographical essay by McCulloch's one-time research assistant, the neuroscientist and computer scientist Michael Arbib. (shrink)

Structuralism about mathematical objects and structuralist accounts of physical computation both face indeterminacy objections. For the former, the problem arises for cases such as the complex roots i and \, for which a automorphism can be defined, thus establishing the structural identity of these importantly distinct mathematical objects. In the case of the latter, the problem arises for logical duals such as AND and OR, which have invertible structural profiles :369–400, 2001). This makes their physical implementations indeterminate, in the sense (...) that their structural profiles alone cannot establish whether a given physical component is an AND-gate or an OR-gate. Doherty has recently shown both problems to be analogous, and has argued that computational structuralism is threatened with the absurd conclusion that computational digits might be indiscernible, such that, if structural properties are all that we have to go on, the binary digit 0 must be treated as identical to the binary digit 1. However, we think that a solution to the indiscernibility problem for mathematical structuralists, drawing on the work of David Hilbert, can be adapted for the analogous problem in the computational case, thereby rescuing the structuralist approach to physical computation. (shrink)

Trust relations in the health services have changed from asymmetrical paternalism to symmetrical autonomy-based participation, according to a common account. The promises of personalized medicine emphasizing empowerment of the individual through active participation in managing her health, disease and well-being, is characteristic of symmetrical trust. In the influential Kantian account of autonomy, active participation in management of own health is not only an opportunity, but an obligation. Personalized medicine is made possible by the digitalization of medicine with an ensuing increased (...) tailoring of diagnostics, treatment and prevention to the individual. The ideal is to increase wellness by minimizing the layer of interpretation and translation between relevant health information and the patient or user. Arguably, this opens for a new level of autonomy through increased participation in treatment and prevention, and by that, increased empowerment of the individual. However, the empirical realities reveal a more complicated landscape disturbed by information ‘noise’ and involving a number of complementary areas of expertise and technologies, hiding the source and logic of data interpretation. This has lead to calls for a return to a mild form of paternalism, allowing expertise coaching of patients and even withholding information, with patients escaping responsibility through blind or lazy trust. This is morally unacceptable, according to Kant’s ideal of enlightenment, as we have a duty to take responsibility by trusting others reflexively, even as patients. Realizing the promises of personalized medicine requires a system of institutional controls of information and diagnostics, accessible for non-specialists, supported by medical expertise that can function as the accountable gate-keeper taking moral responsibility required for an active, reflexive trust. (shrink)

Science and technology have been integral issues of development cooperation for more than sixty years. Contrary to early efforts’ transfer of established technologies from the West to developing countries, contemporary technology aspirations increasingly articulate and practice the Global South as a live laboratory for technological experimentation. This approach is especially furthered by a group of private foundations and philanthrocapitalists whose endeavors in developing countries are, like their companies, shaped by logics of the individual, the market, and of societal progress through (...) technological innovation and experimentation. This article draws upon critical intellectual thought about the political and social ramifications of technology to reflect on the renascent role of technology in development cooperation. It traces the discourses and practices of philanthrocapitalist organizations, in particular the Bill and Melinda Gates Foundation, to understand how their experimentalist technology aspirations influence human life and relations in the Global South. This article argues that this newfound focus on technology in development cooperation may challenge the essence of democracy, reduce participation, and have undesirable consequences for populations in the Global South. (shrink)

The work described in this report is motivated by the desire to test the expressive possibilities of action language C+. The Causal Calculator (CCalc) is a system that answers queries about action domains described in a fragment of that language. The Zoo World and the Traffic World have been proposed by Erik Sandewall in his Logic Modelling Workshop—an environment for communicating axiomatizations of action domains of nontrivial size. -/- The Zoo World consists of several cages and the exterior, (...) class='Hi'>gates between them, and animals of several species, including humans. Actions in this domain include moving within and between cages, opening and closing gates, and mounting and riding animals. The Traffic World includes vehicles moving continuously between road crossings subject to a number of restrictions, such as speed limits and keeping a fixed safety distance away from other vehicles on the road. We show how to represent the two domains in the input language of CCalc, and how to use CCalc to test these representations. (shrink)

Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean functions, is often desired when reliable and correct hardware components are required. The most common approaches to equivalence checking are based on simulation and model checking, which are constrained due to the popular memory and state explosion problems. Furthermore, such tools are often not user-friendly, thereby making it tedious to check the equivalence of large formulas or circuits. An alternative is to use mathematical tools, called interactive theorem (...) provers, to prove the equivalence of two circuits; however, this requires human effort and expertise to write multiple output functions and carry out interactive proof of their equivalence. In this paper, we define two simple, one formal and the other informal, gate-level hardware description languages, design and develop a formal automatic combinational circuit equivalence checker tool, and test and evaluate our tool. The tool CoCEC is based on human-assisted theorem prover Coq, yet it checks the equivalence of circuit descriptions purely automatically through a human-friendly user interface. It either returns a machine-readable proof of circuits’ equivalence or a counterexample of their inequality. The interface enables users to enter or load two circuit descriptions written in an easy and natural style. It automatically proves, in few seconds, the equivalence of circuits with as many as 45 variables. CoCEC has a mathematical foundation, and it is reliable, quick, and easy to use. The tool is intended to be used by digital logic circuit designers, logicians, students, and faculty during the digital logic design course. (shrink)