This article discusses ways to operationalise the concept of culturally appropriate computer-mediated communication, utilising information systems (IS) development methodologies and adopting a postmodern and postcolonial perspective. By way of illustration, it describes progress on the participative development of the Ieramugadu Cultural Information System. This project is designed to develop and evaluate innovative procedures for elicitation, analysis, storage and communication of indigenous cultural heritage information. It is investigating culturally appropriate IS design techniques, multimedia approaches and ways to ensure protection of secret/sacred (...) information. Ethical issues are foregrounded. (shrink)

Makkai [10] produced an arithmetical structure of Scott rank $\omega _{1}^{\mathit{CK}}$. In [9]. Makkai's example is made computable. Here we show that there are computable trees of Scott rank $\omega _{1}^{\mathit{CK}}$. We introduce a notion of "rank homogeneity". In rank homogeneous trees, orbits of tuples can be understood relatively easily. By using these trees, we avoid the need to pass to the more complicated "group trees" of [10] and [9]. Using the same kind of trees, we obtain one (...) of rank $\omega _{1}^{\mathit{CK}}$ that is "strongly computably approximable". We also develop some technology that may yield further results of this kind. (shrink)

We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.

It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework.

We divide the class of infinite computable trees into three types. For the first and second types, 0' computes a nontrivial self-embedding while for the third type 0'' computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite Π01 antichain. This result (...) is optimal and has connections to the program of reverse mathematics. (shrink)

It is known that the full computation-tree logic CTL∗is an important base logic for model checking. The bisimulation theorem for CTL∗is known to be useful for abstraction in model checking. In this paper, thebisimulation theorems for two paraconsistent four-valued extensions 4CTL∗and 4LCTL∗of CTL∗are shown, and a translation from 4CTL∗into CTL∗ispresented. By using 4CTL∗and 4LCTL∗, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework.

ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium (...) for reasoning about branching time. (shrink)

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for (...) reasoning about branching time. (shrink)

We prove that no computable tree of infinite height is computably categorical, and indeed that all such trees have computable dimension ω. Moreover, this dimension is effectively ω, in the sense that given any effective listing of computable presentations of the same tree, we can effectively find another computable presentation of it which is not computably isomorphic to any of the presentations on the list.

We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ03-condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n≥ 1 in ω, there exists a computable tree of finite height which (...) is δ0n+1-categorical but not δ0n-categorical. (shrink)

Computability, while usually performed within the context of ω, may be extended to larger ordinals by means of α-recursion. In this article, we concentrate on the particular case of ω1-recursion, and study the differences in the behavior of ${\rm{\Pi }}_1^0$-classes between this case and the standard one.Of particular interest are the ${\rm{\Pi }}_1^0$-classes corresponding to computable trees of countable width. Classically, it is well-known that the analog to König’s Lemma—“every tree of countable width and uncountable height has an (...) uncountable branch”—fails; we demonstrate that not only does it fail effectively, but also that the failure is as drastic as possible. This is proven by showing that the ω1-Turing degrees of even isolated paths in computable trees of countable width are cofinal in the ${\rm{\Delta }}_1^1\,{\omega _1}$-Turing degrees.Finally, we consider questions of nonisolated paths, and demonstrate that the degrees realizable as isolated paths and the degrees realizable as nonisolated ones are very distinct; in particular, we show that there exists a computable tree of countable width so that every branch can only be ω1-Turing equivalent to branches of trees with ${\aleph _2}$-many branches. (shrink)

We study the position of the computable setting in the “common theory of locality” developed in [4, 5] for local problems on $\Delta $ -regular trees, $\Delta \in \omega $. We show that such a problem admits a computable solution on every highly computable $\Delta $ -regular forest if and only if it admits a Baire measurable solution on every Borel $\Delta $ -regular forest. We also show that if such a problem admits a computable solution (...) on every computable maximum degree $\Delta $ forest then it admits a continuous solution on every maximum degree $\Delta $ Borel graph with appropriate topological hypotheses, though the converse does not hold. (shrink)

This paper presents a method to compute a posteriori probability intervals when the initial conditional information is also given with probability intervals. The right way to make an exact computation is with the associated convex set of probabilities. Probability trees are used to represent these initial conditional convex sets because they greatly save the space required. This paper proposes a simulated annealing algorithm, which uses probability trees to represent the convex sets in order to compute the a posteriori intervals.

For [Formula: see text], the coarse similarity class of [Formula: see text], denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of [Formula: see text] and [Formula: see text] has asymptotic density [Formula: see text]. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of [Formula: see text] and (...) [Formula: see text]. We study the metric space of coarse similarity classes under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly [Formula: see text], [Formula: see text], and [Formula: see text], and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree [Formula: see text] to be attractive if the class of all degrees at distance [Formula: see text] from [Formula: see text] has measure [Formula: see text], and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually [Formula: see text]-random, as well as a perfect set whose elements are mutually [Formula: see text]-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics. (shrink)

We examine the reverse mathematics and computability theory of a form of Ramsey's theorem in which the linear n-tuples of a binary tree are colored.

Tylman has recently pointed out some striking conceptual and methodological analogies between philosophy and computer science. In this paper, I focus on one of Tylman’s most convincing cases, viz. the similarity between Plato’s theory of Ideas and the object-oriented programming paradigm, and analyze it in some more detail. In particular, I argue that the platonic doctrine of the Porphyrian tree corresponds to the fact that most object-oriented programming languages do not support multiple inheritance. This analysis further reinforces Tylman’s point (...) regarding the conceptual continuity between classical metaphysical theorizing and contemporary computer science. (shrink)

In this paper we first give a variant of a theorem of Jockusch–Lewis– Remmel on existence of a computable, degree-preserving homeomorphism between a bounded strong ${\Pi^0_2}$ class and a bounded ${\Pi^0_1}$ class in 2 ω . Namely, we show that for mathematically common and interesting topological spaces, such as computably presented ${\mathbb{R}^n}$ , we can obtain a similar result where the homeomorphism is in fact the identity mapping. Second, we apply this finding to give a new, priority-free proof of (...) existence of a tree of shadow points computable in 0′. (shrink)

Evolutionary and organismal biology have become inundated with data. At the same rate, we are experiencing a surge in broader evolutionary and ecological syntheses for which tree-thinking is the staple for a variety of post-tree analyses. To fully take advantage of this wealth of data to discover and understand large-scale evolutionary and ecological patterns, computational data integration, i.e., the use of machines to link data at large scale, is crucial. The most common shared entity by which evolutionary and (...) ecological data need to be linked is the taxon to which they belong. We propose a set of requirements that a system for defining such taxa should meet for computational data science: taxon definitions should maintain conceptual consistency, be reproducible via a known algorithm, be computationally automatable, and be applicable across the Tree of Life. We argue that Linnaean names, the most prevalent means of linking data to taxa, fail to meet these requirements due to fundamental theoretical and practical shortfalls. We argue that for the purposes of data-integration we should instead use phylogenetic definitions transformed into formal logic expressions. We call such expressions “phyloreferences”, and argue that, unlike Linnaean names, they meet all requirements for effective data-integration. (shrink)

Game trees (or extensive-form games) were first defined by von Neumann and Morgenstern in 1944. In this paper we examine the use of game trees for representing Bayesian decision problems. We propose a method for solving game trees using local computation. This method is a special case of a method due to Wilson for computing equilibria in 2-person games. Game trees differ from decision trees in the representations of information constraints and uncertainty. We compare the game tree representation and (...) solution technique with other techniques for decision analysis such as decision trees, influence diagrams, and valuation networks. (shrink)

"The Natural System" is the name given to the underlying arrangement present in the diversity of life. Unlike a classification, which is made up of classes and members, a system or arrangement is an integrated whole made up of connected parts. In the pre-evolutionary period a variety of forms were proposed for the Natural System, including maps, circles, stars, and abstract multidimensional objects. The trees sketched by Darwin in the 1830s should probably be considered the first genuine evolutionary diagrams of (...) the Natural System—the first genuine evolutionary trees. Darwin refined his image of the Natural System in the well-known evolutionary tree published in the Origin of Species, where he also carefully distinguished between arrangements and classifications. Following the publication of the Origin, there was a great burst of evolutionary tree building, but interest in trees declined substantially after 1900, only to be revived in recent years with the development of cladistic analysis. ¶ While evolutionary trees are modern diagrams of the Natural System, they are at the same time instances of another broad class of diagrams that may be called "trees of history": branching diagrams of genealogical descent and change. During the same years that Darwin was sketching his first evolutionary trees, the earliest examples of two other trees of history also appeared: the first trees of language evolution and of manuscript genealogy. Though these were apparently independent of evolutionary trees in their origin, the similarities among all these trees of history, and among the historical processes that underlie them, were soon recognized. Darwin compared biological evolution and language evolution several times in the Origin of Species, and both Ernst Haeckel and the linguist August Schleicher made similar comparisons. Both linguists and stemmaticists (students of manuscript descent) understood the principle of apomorphy—the principle that only shared innovations provide evidence of common ancestry—more clearly than did systematists, and if there had been more cross-fertilization among these fields the cladistic revolution in systematics might well have taken place in the nineteenth century. ¶ Although historical linguists and stemmaticists have in some respects had sounder theory than have systematists, at least until recently, they have also had the practical problem of very large amounts of data, a problem not often faced by systematists until the advent of molecular sequencing. The opportunity now exists for systematists to contribute to the theory and practice of linguistics and stemmatics, their sister disciplines in historical reconstruction, through application of our commonly used computer programs for tree estimation. Preliminary results from the application of numerical cladistic analysis to a large stemmatic data set have been very encouraging, and have already generated much discussion in the stemmatics community. (shrink)

This paper presents an analysis of Seneca's 58th letter to Lucilius and Porphyry's Isagoge, which were the origin of the tree diagrams that became popular in philosophy and logic from the early Middle Ages onwards. These diagrams visualise the extent to which a concept can be understood as a category, genus, species or individual and what the method of dihairesis (division) means. The paper explores the dissimilarities between Seneca's and Porphyry's tree structures, scrutinising them through the perspective of (...) modern graph theory. Although traditional trees can be interpreted in a modern way, their terms and definitions defy modern standardisation. These distinctions are not only useful for differentiating between Seneca's and Porphyry's trees, but also for comprehending the evolution of this philosophical tradition. Thus the paper highlights the continued significance of these tree diagrams in analysing concepts and categories in philosophy and structuring objects and information in modern fields such as artificial intelligence, computer science, bioinformatics, graph theory, and many more. (shrink)

The tense tree method extends Jeffrey’s well-known formulation of classical propositional logic to tense logic (Jeffrey 1991).1 Tense trees combine pure tense logic with features of Prior’s U-calculi (where ‘U’ is the earlier-than relation; see Prior 1967 and the Introduction to this volume). The tree method has a number of virtues: trees are well suited to computational applications; semantically, the tree systems presented here are no less illuminating than model theory; the metatheory associated with tree formulations (...) is often more tractable than that required in a model-theoretic setting; and last but not least the tree method is ideal for pedagogical purposes. (shrink)

In this paper we show the adequacy of tense logic with unary operators for dealing with finite trees. We prove that models on finite trees can be characterized by tense formulas, and describe an effective method to find an axiomatization of the theory of a given finite tree in tense logic. The strength of the characterization is shown by proving that adding the binary operators "Until" and "Since" to the language does not result in a better description than that (...) given by unary tense logic; although the greater expressive power of "Until" and "Since" can be exploited by using the semantics of e-frames instead of traditional Kripke semantics. (shrink)

A sufficient condition for an extension of positive logic with strong negation to be characterized by a class of finite trees is given.

Our main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.

Each of our theories of mental representation provides some insight into how the mind works. However, these insights often seem incompatible, as the debates between symbolic, dynamical, emergentist, sub-symbolic, and grounded approaches to cognition attest. Mental representations—whatever they are—must share many features with each of our theories of representation, and yet there are few hypotheses about how a synthesis could be possible. Here, I develop a theory of the underpinnings of symbolic cognition that shows how sub-symbolic dynamics may give rise (...) to higher-level cognitive representations of structures, systems of knowledge, and algorithmic processes. This theory implements a version of conceptual role semantics by positing an internal universal representation language in which learners may create mental models to capture dynamics they observe in the world. The theory formalizes one account of how truly novel conceptual content may arise, allowing us to explain how even elementary logical and computational operations may be learned from a more primitive basis. I provide an implementation that learns to represent a variety of structures, including logic, number, kinship trees, regular languages, context-free languages, domains of theories like magnetism, dominance hierarchies, list structures, quantification, and computational primitives like repetition, reversal, and recursion. This account is based on simple discrete dynamical processes that could be implemented in a variety of different physical or biological systems. In particular, I describe how the required dynamics can be directly implemented in a connectionist framework. The resulting theory provides an “assembly language” for cognition, where high-level theories of symbolic computation can be implemented in simple dynamics that themselves could be encoded in biologically plausible systems. (shrink)

Trees architectural study shows gradients in the meristematic activity. This activity is described by the number of internodes per growth unit, which is considered as the output of a dynamic random process. Several species were observed, which led us to propose and then estimate some mathematical models. Computing the functioning of a tree in a given environment therefore involves finding the probability function of the meristems and following the evolution of the parameters of this law along the botanical gradients (...) (order, trend, acrotony) within its architecture. (shrink)

In this paper, we show that for any computable ordinal α, there exists a computable tree of rank with strong degree of categoricity if α is finite, and with strong degree of categoricity if α is infinite. In fact, these are the greatest possible degrees of categoricity for such trees. For a computable limit ordinal α, we show that there is a computable tree of rank α with strong degree of categoricity (which equals ). (...) It follows from our proofs that, for every computable ordinal, the isomorphism problem for trees of rank α is ‐complete. (shrink)

Individuals with agrammatic Broca's aphasia experience difficulty when processing reversible non-canonical sentences. Different accounts have been proposed to explain this phenomenon. The Trace Deletion account attributes this deficit to an impairment in syntactic representations, whereas others propose that the underlying structural representations are unimpaired, but sentence comprehension is affected by processing deficits, such as slow lexical activation, reduction in memory resources, slowed processing and/or intermittent deficiency, among others. We test the claims of two processing accounts, slowed processing and intermittent deficiency, (...) and two versions of the Trace Deletion Hypothesis, in a computational framework for sentence processing implemented in ACT-R. The assumption of slowed processing is operationalized as slow procedural memory, so that each processing action is performed slower than normal, and intermittent deficiency as extra noise in the procedural memory, so that the parsing steps are more noisy than normal. We operationalize the TDH as an absence of trace information in the parse tree. To test the predictions of the models implementing these theories, we use the data from a German sentence—picture matching study reported in Hanne, Sekerina, Vasishth, Burchert, and De Bleser. The data consist of offline and online measures. From among the models considered, the model assuming that both slowed processing and intermittent deficiency are present emerges as the best model of sentence processing difficulty in aphasia. The modeling of individual differences suggests that, if we assume that patients have both slowed processing and intermittent deficiency, they have them in differing degrees. (shrink)

Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

In their simplest form, hybrid languages are propositional modal languages which can refer to states. They were introduced by Arthur Prior, the inventor of tense logic, and played an important role in his work: because they make reference to specific times possible, they remove the most serious obstacle to developing modal approaches to temporal representation and reasoning. However very little is known about the computational complexity of hybrid temporal logics.In this paper we analyze the complexity of the satisfiability problem of (...) a number of hybrid temporal logics: the basic hybrid language over transitive trees; nominal Until logic; and referential interval logic. We discuss the effects of including nominals, the @ operator, the somewhere modality E, and the difference operator D. Adding nominals to tense logic leads for several frame-classes to an increase in complexity of the satisfiability problem from PSPACE to EXPTIME. On transitive trees, however, the satisfiability problem for this language can be decided in PSPACE. Along the way we make a detour through hybrid propositional dynamic logic: we establish upper bounds for a number of temporal logics by generalizing results due to Passy and Tinchev [29] and De Giacomo [16]. We conclude with some remarks on the relevance of our results to description logic, and draw attention to the utility of the spypoint technique for proving upper and lower bounds. (shrink)

This text presents the research field of natural/unconventional computing as it appears in the book COMPUTING NATURE. The articles discussed consist a selection of works from the Symposium on Natural Computing at AISB-IACAP (British Society for the Study of Artificial Intelligence and the Simulation of Behaviour and The International Association for Computing and Philosophy) World Congress 2012, held at the University of Birmingham, celebrating Turing centenary. The COMPUTING NATURE is about nature considered as the totality of physical existence, the universe. (...) By physical we mean all phenomena, objects and processes, that are possible to detect either directly by our senses or via instruments. Historically, there have been many ways of describing the universe (cosmic egg, cosmic tree, theistic universe, mechanistic universe) while a particularly prominent contemporary approach is computational universe, as discussed in this article. See more: http://arxiv.org/abs/1210.7784. (shrink)

We describe the motivation for the construction of a general framework for priority arguments, the ideas incorporated into the construction of the framework, and the use of the framework to prove theorems in computability theory which require priority arguments.

From the 1960s, mathematical and computational tools have been developed to arrive at human population trees from various kinds of serological and molecular data. Focusing on the work of the Italian-born population geneticist Luigi Luca Cavalli-Sforza, I follow the practices of tree-building and mapping from the early blood-group studies to the current genetic admixture research. I argue that the visual language of the tree is paralleled in the narrative of the human diasporas, and I show how the (...) class='Hi'>tree was actually mapped onto the surface of the earth. This visual and textual structure is mirrored in the liberal discourse of unity in diversity that has been criticized as running counter to the socio-political effects of human population genetics. From this perspective, one may ask how far the phylogenetic diagram in its various forms is a manifestation of the physics of power that according to Michel Foucault consists in mechanisms that analyse distributions, movements, series, combinations, and that uses instruments to render visible, to register, to differentiate and to compare. It is one among other disciplinary technologies that ensure the ordering of human diversity. In the case of intra-human phylogenetic trees, population samples and labels are one issue. Another is that the separated branches seem to show groups of people, who have in reality been interacting and converging, as isolated. Often based on so-called isolated peoples, molecular tree diagrams freeze a hierarchical kinship system that is meant to represent a state before the great historical population movements. (shrink)

We study human performance in two classical NP‐hard optimization problems: Set Cover and Maximum Coverage. We suggest that Set Cover and Max Coverage are related to means selection problems that arise in human problem‐solving and in pursuing multiple goals: The relationship between goals and means is expressed as a bipartite graph where edges between means and goals indicate which means can be used to achieve which goals. While these problems are believed to be computationally intractable in general, they become more (...) tractable when the structure of the network resembles a tree. Thus, our main prediction is that people should perform better with goal systems that are more tree‐like. We report three behavioral experiments which confirm this prediction. Our results suggest that combinatorial parameters that are instrumental to algorithm design can also be useful for understanding when and why people struggle to choose between multiple means to achieve multiple goals. (shrink)

This paper presents a comprehensive pragmatic theory of contrastive topic and its relation to focus in English. In discussing various constructions involving contrastive topics, it argues that they make reference to complex, hierarchical aspects of discourse structure. In this, it follows and spells out a proposal sketched in Roberts (1996, p. 121ff),using the formal tools found in Büring (1994,1997b). It improves on existing accounts in the accuracy with which it predicts the non-occurrence of the accent patterns associated with focus and (...) contrastive topic, and locates the analysis of contrastive topicswithin a broader picture of discourse and information structure. (shrink)

Trees architectural study shows gradients in the meristematic activity. This activity is described by the number of internodes per growth unit, which is considered as the output of a dynamic random process. Several species were observed, which led us to propose and then estimate some mathematical models. Computing the functioning of a tree in a given environment therefore involves finding the probability function of the meristems and following the evolution of the parameters of this law along the botanical gradients (...) within its architecture. (shrink)

We compare our model of unsupervised learning of linguistic structures, ADIOS [1, 2, 3], to some recent work in computational linguistics and in grammar theory. Our approach resembles the Construction Grammar in its general philosophy (e.g., in its reliance on structural generalizations rather than on syntax projected by the lexicon, as in the current generative theories), and the Tree Adjoining Grammar in its computational characteristics (e.g., in its apparent affinity with Mildly Context Sensitive Languages). The representations learned by our (...) algorithm are truly emergent from the (unannotated) corpus data, whereas those found in published works on cognitive and construction grammars and on TAGs are hand-tailored. Thus, our results complement and extend both the computational and the more linguistically oriented research into language acquisition. We conclude by suggesting how empirical and formal study of language can be best integrated. (shrink)

The articles in this volume present a selection of works from the Symposium on Natu-ral/Unconventional Computing at AISB/IACAP (British Society for the Study of Artificial Intelligence and the Simulation of Behaviour and The International Association for Computing and Philosophy) World Congress 2012, held at the University of Birmingham, celebrating Turing centenary. This book is about nature considered as the totality of physical existence, the universe. By physical we mean all phenomena - objects and processes - that are possible to detect (...) either directly by our senses or via instruments. Historically, there have been many ways of describ-ing the universe (cosmic egg, cosmic tree, theistic universe, mechanistic universe) and a par-ticularly prominent contemporary approach is computational universe. (shrink)