This book presents the deterministic view of quantum mechanics developed by Nobel Laureate Gerard 't Hooft. Dissatisfied with the uncomfortable gaps in the way conventional quantum mechanics meshes with the classical world, 't Hooft has revived the old hidden variable ideas, but now in a much more systematic way than usual. In this, quantum mechanics is viewed as a tool rather than a theory. The book presents examples of models that are classical in essence, but can be analysed by the (...) use of quantum techniques, and argues that even the Standard Model, together with gravitational interactions, might be viewed as a quantum mechanical approach to analysing a system that could be classical at its core. He shows how this approach, even though it is based on hidden variables, can be plausibly reconciled with Bell's theorem, and how the usual objections voiced against the idea of 'superdeterminism' can be overcome, at least in principle. This framework elegantly explains - and automatically cures - the problems of the wave function collapse and the measurement problem. Even the existence of an "arrow of time" can perhaps be explained in a more elegant way than usual. As well as reviewing the author's earlier work in the field, the book also contains many new observations and calculations. It provides stimulating reading for all physicists working on the foundations of quantum theory. (shrink)

Methods developed in a previous paper are employed to define an exact correspondence between the states of a deterministic cellular automaton in 1+1 dimensions and those of a bosonic quantum field theory. The result may be used to argue that quantum field theories may be much closer related to deterministic automata than what is usually thought possible.

It has been known for long time that the cosmic sound wave was there since the early epoch of the Universe. Signatures of its existence are abound. However, such a sound wave model of cosmology is rarely developed fully into a complete framework. This paper can be considered as our second attempt towards such a complete description of the Universe based on soliton wave solution of cosmological KdV equation. Then we advance further this KdV equation by virtue of Cellular (...) Automaton method to solve the PDEs. We submit wholeheartedly Robert Kurucz’s hypothesis that Big Bang should be replaced with a finite cellular automaton universe with no expansion. Nonetheless, we are fully aware that our model is far from being complete, but it appears the proposed cellular automaton model of the Universe is very close in spirit to what Konrad Zuse envisaged long time ago. It is our hope that the new proposed method can be verified with observation data. But we admit that our model is still in its infancy, more researches are needed to fill all the missing details. (shrink)

Lattice-gas cellular automaton (LGCA) and lattice Boltzmann (LB) models are promising models for studying emergent behaviour of transport and interaction processes in biological systems. In this chapter, we will emphasise the use of LGCA/LB models and the derivation and analysis of LGCA models ranging from the classical example dynamics of fluid flow to clotting phenomena in cerebral aneurysms and the invasion of tumour cells.

In some recent papers (G. ‘t Hooft and others), it has been argued that quantum mechanics can arise from classical cellular automata. Nonetheless, G. Shpenkov has proved that the classical wave equation makes it possible to derive a periodic table of elements, which is very close to Mendeleyev’s one, and describe also other phenomena related to the structure of molecules. Hence the classical wave equation complements Schrödinger’s equation, which implies the appearance of a cellular automaton molecular model (...) starting from classical wave equation. The other studies show that the microworld is constituted as a tessellation of primary topological balls. The tessellattice becomes the origin of a submicrospic mechanics in which a quantum system is subdivided to two subsystems: the particle and its inerton cloud, which appears due to the interaction of the moving particle with oncoming cells of the tessellattice. The particle and its inerton cloud periodically change the momentum and hence move like a wave. The new approach allows us to correlate the Klein-Gordon equation with the deformation coat that is formed in the tessellatice around the particle. The submicroscopic approach shows that the source of any type of wave movements including the Klein-Gordon, Schrödinger, and classical wave equations is hidden in the tessellattice and its basic exciations – inertons, carriers of mass and inert properies of matter. We also discuss possible correspondence with Konrad Zuse’s calculating space. (shrink)

In this paper I explore the question of how artificial life might be used to get a handle on philosophical issues concerning the mind-body problem. I focus on questions concerning what the physical precursors were to the earliest evolved versions of intelligent life. I discuss how cellular automata might constitute an experimental platform for the exploration of such issues, since cellular automata offer a unified framework for the modeling of physical, biological, and psychological processes. I discuss what it (...) would take to implement in a cellular automaton the evolutionary emergence of cognition from non-cognitive artificial organisms. I review work on the artificial evolution of minimally cognitive organisms and discuss how such projects might be translated into cellular automata simulations. (shrink)

Varela, Thompson, and Rosch illustrated their original presentation of the enactive theory of cognition with the example of a simple cellular automaton. Their theory was paradigmatically anti-computational, and yet automata similar to the one that they describe have typically been used to illustrate theories of computation, and are usually treated as abstract computational systems. Their use of this example is therefore puzzling, especially as they do not seem to acknowledge the discrepancy. The solution to this tension lies in (...) recognizing a hidden background assumption, shared by both Varela, Thompson, and Rosch and the computational theories of mind which they were responding to. This assumption is that computation requires representation, and that computational states must bear representational content. For Varela, Thompson, and Rosch, representational content is incompatible with cognition, and so from their perspective the automaton that they describe cannot, despite appearances, be computational. However, there now exist several accounts of computation that do not make this assumption, and do not characterize computation in terms of representational content. In light of these recent developments, we will argue that it is quite straightforward to characterize the enactive automaton as a non-representational computing mechanism, one that we do not think they should have any objections to. (shrink)

A cellular automaton that is related to the "mosaic cycle concept" is considered. We explain why such automata sustain very often, but not always, n-periodic trajectories (n being the number of states of the automaton). Our work is a first step in the direction of a theory of these type of automata which might be useful in modeling mosaic successions.

Some years ago, Hidding et al. suggest that the emergence of intricate and pervasive weblike structure of the Universe on Megaparsec scales can be approximated by a well-known equation from fluid mechanics, the Burgers’ equation. The solution to this equation can be obtained from a geometrical formalism. The resulting Adhesion formalism provides deep insight into the dynamics and topology of the Cosmic Web. It uncovers a direct connection between the conditions in the very early Universe and the complex spatial patterns (...) that emerged out of these under the influence of gravity. In the present paper, we describe a cellular automaton model of the Burgers’ equation, which can be investigated via a fast computer simulation. In the end, this suggests a Cellular Automata Adhesion Model of the Universe. (shrink)

In this paper we give a new proof of Richardson's theorem [31]: a global function G[MATHEMATICAL DOUBLE-STRUCK CAPITAL A] of a cellular automaton [MATHEMATICAL DOUBLE-STRUCK CAPITAL A] is injective if and only if the inverse of G[MATHEMATICAL DOUBLE-STRUCK CAPITAL A] is a global function of a cellular automaton. Moreover, we show a way how to construct the inverse cellular automaton using the method of feasible interpolation from [20]. We also solve two problems regarding complexity (...) of cellular automata formulated by Durand [12]. (shrink)

We present a distributed control modeling approach for an automated manufacturing system based on the dynamics of one-dimensional cellular automata. This is inspired by the fact that both cellular automata and manufacturing systems are discrete dynamical systems where local interactions given among their elements can lead to complex dynamics, despite the simple rules governing such interactions. The cellular automaton model developed in this study focuses on two states of the resources of a manufacturing system, namely, busy (...) or idle. However, the interaction among the resources such as whether they are shared at different stages of the manufacturing process determines the global dynamics of the system. A procedure is shown to obtain the local evolution rule of the automaton based on the relationships among the resources and the material flow through the manufacturing process. The resulting distributed control of the manufacturing system appears to be heterarchical, and the evolution of the cellular automaton exhibits a Class II behavior for some given disordered initial conditions. (shrink)

Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular automata theory follows, whose relativistic limit of small wave-vector provides the free dynamics of quantum field theory. The QCA theory can be regarded as an extended quantum field theory that describes in a unified way all scales ranging from an hypothetical discrete Planck scale up to the usual Fermi (...) scale. The present paper reviews the automaton theory for the Weyl field, and the composite automata for Dirac and Maxwell fields. We then give a simple analysis of the dynamics in the momentum space in terms of a dispersive differential equation for narrowband wave-packets. We then review the phenomenology of the free-field automaton and consider possible visible effects arising from the discreteness of the framework. We conclude introducing the consequences of the automaton dispersion relation, leading to a deformed Lorentz covariance and to possible effects on the thermodynamics of ideal gases. (shrink)

After leading to a new axiomatic derivation of quantum theory, the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field theory to including an hypothetical Planck scale, and with the usual quantum field theory recovered in the relativistic limit of small wave-vectors. Being derived from simple principles, the automata theory is quantum ab-initio, and does not assume Lorentz covariance and mechanical notions. Being discrete (...) it can describe localized states and measurements, solving all the issues plaguing field theory originated from the continuum. These features make the theory an ideal framework for quantum gravity, with relativistic covariance and space-time emergent solely from the interactions, and not assumed a priori. The paper presents a synthetic derivation of the automata theory, showing how the principles lead to a description in terms of a quantum automaton over a Cayley graph of a group. Restricting to Abelian groups we show how the automata recover the Weyl, Dirac and Maxwell dynamics in the relativistic limit. We conclude with some new routes about the more general scenario of non-Abelian Cayley graphs. The phenomenology arising from the automata theory in the ultra-relativistic domain and the analysis of corresponding distorted Lorentz covariance is reviewed in Bisio et al. (shrink)

Philosophical concepts are easier to teach and to learn if students can directly manually and visually manipulate the objects instantiating them. What is needed is a philosophy laboratory in which students learn by experimenting. Games are highly idealized yet concrete structures able to instantiate abstract concepts. I show how to use the Game of Life (a computerized cellular automaton "game") to teach concepts like: individuation; supervenience; the phenomena / noumena distinction; the physical / design / and intentional stances; (...) the argument from design; and models for Leibnizian monads. Such formal games are good ways to use computers to teach philosophy. (shrink)

I discuss here a number of different kinds of diachronic emergence, noting that they differ in important ways from synchronic conceptions. I argue that Bedau’s weak emergence has an essentially historical aspect, in that there can be two indistinguishable states, one of which is weakly emergent, the other of which is not. As a consequence, weak emergence is about tokens, not types, of states. I conclude by examining the question of whether the concept of weak emergence is too weak and (...) note that there is at present no unifying account of diachronic and synchronic concepts of emergence. (shrink)

The central motivating idea behind the development of this work is the concept of prespace, a hypothetical structure that is postulated by some physicists to underlie the fabric of space or space-time. I consider how such a structure could relate to space and space-time, and the rest of reality as we know it, and the implications of the existence of this structure for quantum theory. Understanding how this structure could relate to space and to the rest of reality requires, I (...) believe, that we consider how space itself relates to reality, and how other so-called "spaces" used in physics relate to reality. In chapter 2, I compare space and space-time to other spaces used in physics, such as configuration space, phase space and Hilbert space. I support what is known as the "property view" of space, opposing both the traditional views of space and space-time, substantivalism and relationism. I argue that all these spaces are property spaces. After examining the relationships of these spaces to causality, I argue that configuration space has, due to its role in quantum mechanics, a special status in the microscopic world similar to the status of position space in the macroscopic world. In chapter 3, prespace itself is considered. One way of approaching this structure is through the comparison of the prespace structure with a computational system, in particular to a cellular automaton, in which space or space-time and all other physical quantities are broken down into discrete units. I suggest that one way open for a prespace metaphysics can be found if physics is made fully discrete in this way. I suggest as a heuristic principle that the physical laws of our world are such that the computational cost of implementing those laws on an arbitrary computational system is minimized, adapting a heuristic principle of this type proposed by Feynman. In chapter 4, some of the ideas of the previous chapters are applied in an examination of the physics and metaphysics of quantum theory. I first discuss the "measurement problem" of quantum mechanics: this problem and its proposed solution are the primary subjects of chapter 4. It turns out that considering how quantum theory could be made fully discrete leads naturally to a suggestion of how standard linear quantum mechanics could be modified to give rise to a solution to the measurement problem. The computational heuristic principle reinforces the same solution. I call the modified quantum mechanics Critical Complexity Quantum Mechanics (CCQM). I compare CCQM with some of the other proposed solutions to the measurement problem, in particular the spontaneous localization model of Ghirardi, Rimini and Weber. Finally, in chapters 5 and 6, I argue that the measure of complexity of quantum mechanical states I introduce in CCQM also provides a new definition of entropy for quantum mechanics, and suggests a solution to the problem of providing an objective foundation for statistical mechanics, thermodynamics, and the arrow of time. (shrink)

The dynamics-from-permutations of classical Ising spins is generalized here for an arbitrarily long chain. This serves as an ontological model with discrete dynamics generated by pairwise exchange interactions defining the unitary update operator. The model incorporates a finite signal velocity and resembles in many aspects a discrete free field theory. We deduce the corresponding Hamiltonian operator and show that it generates an exact terminating Baker–Campbell–Hausdorff formula. Motivation for this study is provided by the Cellular Automaton Interpretation of Quantum (...) Mechanics. We find that our ontological model, which is classical and deterministic, appears as if of quantum mechanical kind in an appropriate formal description. However, it is striking that small deformations of the model turn it into a genuine quantum theory. This supports the view that quantum mechanics stems from an epistemic approach handling physical phenomena. (shrink)

In this paper we study the emergence of Minkowski space–time from a discrete causal network representing a classical information flow. Differently from previous approaches, we require the network to be topologically homogeneous, so that the metric is derived from pure event-counting. Emergence from events has an operational motivation in requiring that every physical quantity—including space–time—be defined through precise measurement procedures. Topological homogeneity is a requirement for having space–time metric emergent from the pure topology of causal connections, whereas physically homogeneity corresponds (...) to the universality of the physical law. We analyze in detail the case of 1+1 dimensions. If we consider the causal connections as an exchange of classical information, we can establish coordinate systems via an Einsteinian protocol, and this leads to a digital version of the Lorentz transformations. In a computational analogy, the foliation construction can be regarded as the synchronization with a global clock of the calls to independent subroutines in a parallel distributed computation. Thus the Lorentz time-dilation emerges as an increased density of leaves within a single tic-tac of a clock, whereas space-contraction results from the corresponding decrease of density of events per leaf. The operational procedure of building up the coordinate system introduces an in-principle indistinguishability between neighboring events, resulting in a network that is coarse-grained, the thickness of the event being a function of the observer's clock. The illustrated simple classical construction can be extended to space dimension greater than one, with the price of anisotropy of the maximal speed, due to the Weyl-tiling problem. This issue is cured if the causal network is quantum, as e.g. in a quantum cellular automaton, and isotropy is recovered by quantum coherence via superposition of causal paths. We thus argue that in a causal network description of space–time, the quantum nature of the network is crucial. (shrink)

“There’s Plenty of Room at the Bottom”, said the title of Richard Feynman’s 1959 seminal conference at the California Institute of Technology. Fifty years on, nanotechnologies have led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models—one still largely missing is reversibility. The dynamic laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final (...) states. On the other hand, as von Neumann already conjectured, irreversible information processing is expensive: to erase a single bit of information costs ~3 × 10−21 joules at room temperature. Information entropy is a thermodynamic cost, to be paid in non-computational energy dissipation. This paper addresses the problem drawing on Edward Fredkin’s Finite Nature hypothesis: the ultimate nature of the universe is discrete and finite, satisfying the axioms of classical, atomistic mereology. The chosen model is a cellular automaton with reversible dynamics, capable of retaining memory of the information present at the beginning of the universe. Such a CA can implement the Boolean logical operations and the other building bricks of computation: it can develop and host all-purpose computers. The model is a candidate for the realization of computational systems, capable of exploiting the resources of the physical world in an efficient way, for they can host logical circuits with negligible internal energy dissipation. (shrink)

Image segmentation in land cover regions which are overlapping in satellite imagery, is one crucial challenge. To detect true belonging of one pixel becomes a challenging problem while classifying mixed pixels in overlapping regions. In current work, we propose one new approach for image segmentation using a hybrid algorithm of K-Means and Cellular Automata algorithms. This newly implemented unsupervised model can detect cluster groups using hybrid 2-Dimensional Cellular-Automata model based on K-Means segmentation approach. This approach detects different land (...) use land cover areas in satellite imagery by existing K-Means algorithm. Since it is a discrete dynamical system, cellular automaton realizes uniform interconnecting cells containing states. In the second stage of current model, we experiment with a 2-dimensional cellular automata to rank allocations of pixels among different land-cover regions. The method is experimented on the watershed area of Ajoy river (India) and Salinas (California) data set with true class labels using two internal and four external validity indices. The segmented areas are then compared with existing FCM, DBSCAN and K-Means methods and verified with the ground truth. The statistical analysis results also show the superiority of the new method. (shrink)

I discuss the view, increasingly common in physics, that the foundational level of our physical reality is a network of computing machines (so that our universe is ultimately like a cellular automaton). I discuss finitely extended and divided (discrete) space-time and discrete causality. I examine reasons for thinking that the foundational computational complexity of our universe is finite. I discuss the emergence of an ordered complexity hierarchy of levels of objects over the foundational level and I show how (...) the special sciences study these emergent objects. (shrink)

I have developed an informational interpretation of Leibniz’s metaphysics and dynamics, but in this paper I will concentrate on his theory of time. According to my interpretation, each monad is an incorporeal automaton programed by God, and likewise each organized group of monads is a cellular automaton governed by a single dominant monad. The activities of these produce phenomena, which must be “coded appearances” of these activities; God determines this coding. A crucially important point here is that (...) we have to distinguish the phenomena for a monad from its states. Both are a kind of representation: a state represents the whole world of monads, and phenomena for a monad “result” from the activities of monads. But the coding for each must be different; R for the first, Ph for the second, where W is a state of the monadic world. The reason for this is that no monadic state is in space and time, but phenomena occur in space and time. Now, the basis of the phenomenal time must be in the timeless realm of monads. This basis is the order of state-transition of each monads. All the changes of these states are given at once by God, and these do not presuppose time. The coded appearances of this order occur in time, and its metric must depend on God’s coding for phenomena. For humans, in particular, this metric time is derived from spatial distance via the laws of dynamics. Thus there may well be an interrelation between spatial and temporal metric. This means that the Leibnizian frame allows relativistic metric of space-time. I will show this after outlining Leibniz’s scenario. (shrink)

We examine the consequences of long-range effects on tumour cell migration. Our starting point are previous results of ours where we have shown that the migration patterns of glioma cells are best interpreted if one assumes attractive interactions between cells. Here we complement the cellular automaton model previously introduced by the assumption of the existence of a chemorepellent produced by the main bulk of large spheroids (in the hypoxic/necrotic areas). Visible effects due to the presence of such a (...) substance can be found in the density profiles of cells migrating out of a single spheroid as well as in the angular distribution of cells coming from two close-lying spheroids. These effects depend crucially on the diffusion speed of the chemorepellent. A comparison of the simulation results to experimental data of Werbowetski et al. allows to draw (tentative) conclusions on the existence of a chemorepellent and its properties. (shrink)

This article delineates the notion of conjectural artworks—that is, ways of thinking and explaining formal and relational phenomena by visual means—and presents an appraisal and review of the use of such visual ways in the work of Chilean biologists and philosophers Humberto Maturana and Francisco Varela. Particularly, the article focuses on their recurrent uses of Cellular Automaton, that is, discrete, locally interacting, rule-based mathematical models, as conjectural artworks for understanding the concepts of autopoiesis, structural coupling, cognition and enaction: (...) (i.e. Protobio and Bittorio). Additionally, the article proposes a new model of conjectural artwork based on an extension of cellular automaton: random Boolean networks namely, binary systems with variable local connections. Such model, as it is argued, is useful to connect the theoretical frameworks by Maturana and Varela, especially structural coupling and enaction, with other relevant fields such as biosemiotics’ Umwelt-research and cognitive landscapes in neurodynamics, and to advance and explore the concepts of structurally coupled categorization and generalization. (shrink)

Since the foundation of the Santa Fe Institute, the new science of complex adaptive systems has seen extraordinary development, breaking with previous, more epistemological, trends in complexity theory. This article makes a critique of CAS as a model of the current global complexity. Its basic model, the cellular automaton, which focuses on the interactive dynamics among components, ignores the nature of any complex system as constructed by the observer/actor and is unable to explain the sociohistorical construction of the (...) agents/subjects and the social structure in which they are located, thus being unable to accurately represent the overall social complexity. (shrink)

We explore the possibility of teaching philosophy through the teaching of computer programming. It is pedagogically useful to use programming because it is extremely popular (especially due to the recent breakthroughs in machine learning), and it can provide a novel, interesting, and clear introduction to a variety of classic philosophical issues. We discuss two examples. The first is using programming to solve digital image manipulation tasks as a way of introducing and clarifying debates over external world skepticism. The second is (...) programming a simulation of a simple 2-D cellular automaton as a way of introducing and clarifying debates over determinism and free will. (shrink)

A continuous spatial automaton is analogous to a cellular automaton, except that the cells form a continuum, as do the possible states of the cells. After an informal mathematical description of spatial automata, we describe in detail a continuous analog of Conway’s “Life,” and show how the automaton can be implemented using the basic operations of field computation.

This paper starts with the study of realistic three-dimensional models, from the two aspects of ink art style simulation model and three-dimensional display technology, explores the three-dimensional display model of three-dimensional model ink style, and conducts experiments through the software development platform and auxiliary software. The feasibility of the model is verified. Aiming at the problem of real-time rendering of large-scale 3D scenes in the model, efficient visibility rejection method and a multiresolution fast rendering method were designed to realize the (...) rapid construction and rendering of ink art 3D virtual reality scenes in a big data environment. A two-dimensional cellular automaton is used to simulate a brushstroke model with ink and wash style, and outlines are drawn along the path of the brushstroke to obtain an effect close to the artistic style of ink and wash painting. Set the surface of the model with ink style brushstroke texture patterns, refer to the depth map, normal map, and curvature map information of the model, and simulate the drawing effect of the method by procedural texture mapping. Example verification shows that the rapid visualization analysis model of ink art big data designed in this paper is in line with the prediction requirements of ink art big data three-dimensional display indicators. The fast visibility removal method is used to deal with large-scale three-dimensional ink art in a big data environment. High efficiency is achieved in virtual reality scenes, and the multiresolution fast rendering method better maintains the appearance of the prediction model without major deformation. (shrink)

Critical phenomena in stock exchange are regularly occurring and difficult to predict events, often leading to disastrous consequences. The presented paper is devoted to the search and research of early warning signals of critical transitions in stock exchange based on the results of a multifractal analysis of a series of transactions in shares of public companies. We have proposed and justified the use of certain features of behavior of multifractal spectrum shape parameters such as signals. As model time series, on (...) which methods of multifractal analysis were tested, we used a series of the number of unstable sites of the sandpile automaton on the random Erdős–Rényi graph, self-organizing into critical and bistable states. It was found that the early warning signals for both cellular automata and stock exchanges are an increase in the magnitude of the maximum position, a decrease in the width, and a decrease, followed by a sharp increase, in the value of the spectrum asymmetry parameter. (shrink)

Computational approaches in systems biology have become a powerful tool for understanding the fundamental mechanisms of cellular metabolism and regulation. However, the interplay between the regulatory and the metabolic system is still poorly understood. In particular, there is a need for formal mathematical frameworks that allow analyzing metabolism together with dynamic enzyme resources and regulatory events. Here, we introduce a metabolic-regulatory network model that allows integrating metabolism with transcriptional regulation, macromolecule production and enzyme resources. Using this model, we show (...) that the dynamic interplay between these different cellular processes can be formalized by a hybrid automaton, combining continuous dynamics and discrete control. (shrink)

How could the kinds of grammars that linguists write actually be used in models of perceptual processing? This book relates grammars to cognitive architecture. It shows how incremental parsing works, step-by-step, and how specific learning rules might lead to frequency-sensitive preferences. Along the way, Hale reconsiders garden-pathing, the parallel/serial distinction and information-theoretical complexity metrics such as surprisal. A "must" for cognitive scientists of language. ".

Eugene Marshall presents an original, systematic account of Spinoza's philosophy of mind, in which the mind is presented as an affective mechanism that, when rational, behaves as a spiritual automaton. He explores key themes in Spinoza's thought, and illuminates his philosophical and ethical project in a striking new way.

Cellular automata (henceforth: CA) are discrete, abstract computational systems that have proved useful both as general models of complexity and as more specific representations of non-linear dynamics in a variety of scientific fields. Firstly, CA are (typically) spatially and temporally discrete: they are composed of a finite or denumerable set of homogeneous, simple units, the atoms or cells. At each time unit, the cells instantiate one of a finite set of states. They evolve in parallel at discrete time steps, (...) following state update functions or dynamical transition rules: the update of a cell state obtains by taking into account the states of cells in its local neighborhood (there are, therefore, no actions at a distance). Secondly, CA are abstract, as they can be specified in purely mathematical terms and implemented in physical structures. Thirdly, CA are computational systems: they can compute functions and solve algorithmic problems. Despite functioning in a different way from traditional, Turing machine-like devices, CA with suitable rules can emulate a universal Turing machine, and therefore compute, given Turing's Thesis, anything computable.... (shrink)

A brief history of affective responses to AI.

Cells live in dynamic environments that necessitate perpetual adaptation. Since cells have limited resources to monitor external inputs, they are required to maximize the information content of perceived signals. This challenge is not unique to microscopic life: Animals use senses to perceive inputs and adequately respond. Research showed that sensory‐perception is actively shaped by learning and expectation allowing internal cognitive models to “fill in the blanks” in face of limited information. We propose that cells employ analogous strategies and use internal (...) models shaped through the long process of evolutionary adaptation. Given this perspective, we postulate that cells are prone to “misperceptions,” analogous to visual illusions, leading them to incorrectly decode patterns of inputs that lie outside of their evolutionary experience. Mapping cellular misperception can serve as a fundamental approach for dissecting regulatory networks and could be harnessed to modulate cell behavior, a potentially new avenue for therapy. (shrink)

We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing strategies which are implementable by a machine with a bound on its complexity. One player has to use a finite automaton while the other player has to use a finite perceptron. Some examples illustrate that the sets of strategies which are induced by these two types of machines are different and not ordered by set inclusion. Repeated game payoffs are evaluated according to the limit (...) of means. The main result establishes that a cooperation at almost all stages of the game is an equilibrium outcome if the complexity of the machines the players may use is limited enough and if the length T of the repeated game is sufficiently large. This result persists when more than T states are allowed in the player’s automaton. We further consider a variant of the model in which the two players are restricted to choosing strategies which are implementable by perceptrons and prove that the players can cooperate at most of the stages provided that the complexity of their perceptrons is sufficiently reduced. (shrink)

Recall that for any Boolean algebra (BA) A, the cellularity of A is c(A) = sup{|X| : X is a pairwise-disjoint subset of A}. A pseudo-tree is a partially ordered set (T, ≤) such that for every t in T, the set {r ∊ T : r ≤ t} is a linear order. The pseudo-tree algebra on T, denoted Treealg(T), is the subalgebra of ℘(T) generated by the cones {r ∊ T : r ≥ t}, for t in T. We (...) characterize the cellularity of pseudo-tree algebras in terms of cardinal functions on the underlying pseudo-trees. For T a pseudo-tree, c(Treealg(T)) is the maximum of four cardinals c\sbT, ι\sbT, φ\sbT, and μ\sbT : roughly, c\sbT measures the "tallness" of the pseudo-tree T; ι\sbT the "breadth"; φ\sbT the number of "finite branchings"; and μ\sbT the number of places where T "does not branch." We give examples to demonstrate that all four of these cardinals are needed. (shrink)

Depression might be associated with accelerated cellular aging. However, does this result in an irreversible state or is the body able to slow down or recover from such a process? Telomeres are DNA‐protein complexes that protect the ends of chromosomes and generally shorten with age; and therefore index cellular aging. The majority of studies indicate that persons with depression have shorter leukocyte telomeres than similarly aged non‐depressed persons, which may contribute to the observed unfavorable somatic health outcomes in (...) the depressed population. Some small‐scale preliminary studies raise the possibility that behavioral or pharmacological interventions may either slow down or else reverse this accelerated telomere shortening, possibly through increasing the activity of the telomere‐lengthening enzyme telomerase. This paper covers the current state of evidence in the relationship between depression and the telomere‐telomerase system and debates whether depression‐related cellular aging should be considered a reversible process or permanent damage. (shrink)

Unlike eggs and diatoms, most single cells in nature do not have structured shells to provide extensive protection. It is a challenge to artificially confer shell structures on living cells to improve their inherent properties and functions. We discuss four different types of cellular shellizations: man‐made hydrogels, sol‐gels, polyelectrolytes, and mineral shells. We also explore potential applications, such as cell storage, protection, delivery, and therapy. We suggest that shellization could provide another means to regulate and functionalize cells. Specifically, the (...) integration of living cells and non‐living functional shells may be developed as a novel strategy to create “super” or intelligent cells. Unlike biological approaches, this material‐based bio‐interface regulation is inexpensive, effective, and convenient, opening up a novel avenue for cell‐based technologies and practices. (shrink)

We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular grammar logics can be obtained using our tableau calculus. We also give an effective Craig interpolation lemma for (...) regular grammar logics using our calculus. (shrink)

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by (...) Baldwin–Eklof–Trlifaj are stable and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický. (shrink)