Bohman develops a realistic model of deliberation by gradually introducing and analyzing the major tests facing deliberative democracy: cultural pluralism, social inequalities, social complexity, and community-wide biases and ideologies.

Many contemporary philosophers writing on punishment seek to show that much of the dispute between retributionists and utilitarians springs from a failure on the part of both parties to elucidate the concept of punishment. The writers are usually utilitarians who seek to show that what is true in the retributive theory is simply a point about the concept of punishment, and that for the rest, the morality of punishment is to be explained in terms of the utilitarian theory. Those who (...) attempt to destroy the retributive theory by reducing its element of truth to a mere conceptual point about the concept of punishment, seek to argue that the notion of being guilty of an offence is part of the concept of punishment. Against this kind of approach, I wish to consider whether a general theory of punishment is possible, and if so, what are its basic concepts—punishment, deserving of punishment, deserved, or justifiable punishment—and how they are to be elucidated. I shall be concerned to argue that much contemporary writing on punishment commits the Platonic fallacy of assuming that there is a single, core, paradigm use of ‘punishment’ which is to be found by elucidating the concept of legal punishment. (shrink)

Arguments for or against a trend in the evolution of complexity are weakened by the lack of an unambiguous definition of complexity. Such definitions abound for both dynamical systems and biological organisms, but have drawbacks of either a conceptual or a practical nature. Physical complexity, a measure based on automata theory and information theory, is a simple and intuitive measure of the amount of information that an organism stores, in its genome, about the environment in which it (...) evolves. It is argued that physical complexity must increase in molecular evolution of asexual organisms in a single niche if the environment does not change, due to natural selection. It is possible that complexity decreases in co‐evolving systems as well as at high mutation rates, in sexual populations, and in time‐dependent landscapes. However, it is reasoned that these factors usually help, rather than hinder, the evolution of complexity, and that a theory of physical complexity for co‐evolving species will reveal an overall trend towards higher complexity in biological evolution. BioEssays 24:1085–1094, 2002. © 2002 Wiley‐Periodicals, Inc. (shrink)

In this article we evaluate claims that language structure adapts to sociolinguistic environment. We present the results of two typological case studies examining the effects of the number of native (= L1) speakers and the proportion of adult second language (= L2) learners on language structure. Data from more than 300 languages suggest that testing the effect of population size and proportion of adult L2 learners on features of verbal and nominal complexity produces conflicting results on different grammatical features. (...) The results show that verbal inflectional synthesis adapts to the sociolinguistic environment but the number of genders does not. The results also suggest that modelling population size together with proportion of L2 improves model fit compared to modelling them independently of one another. We thus argue that surveying population size alone may be insufficient to detect possible adaptation of linguistic structure to the sociolinguistic environment. Rather, other features, such as proportion of L2 speakers, prestige and social network density, should be studied, and if demographic numeric data are used, they should not be used in isolation but rather in competition with other sociolinguistic features. We also suggest that not all types of language structures within a given grammatical domain are equally sensitive to the effect of sociolinguistic variables, and that more exploratory studies are needed before we can arrive at a reliable set of grammatical features that may be potentially most (and least) adaptive to social structures. (shrink)

Living organisms are currently most often seen as complex dynamical systems that develop and evolve in relation to complex environments. Reflections on the meaning of the complex dynamical nature of living systems show an overwhelming multiplicity in approaches, descriptions, definitions and methodologies. Instead of sustaining an epistemic pluralism, which often functions as a philosophical armistice in which tolerance and so-called neutrality discharge proponents of the burden to clarify the sources and conditions of agreement and disagreement, this paper aims at analysing: (...) (i) what has been Kant's original conceptualisation of living organisms as natural purposes; (ii) how the current perspectives are to be related to Kant's viewpoint; (iii) what are the main trends in current complexity thinking. One of the basic ideas is that the attention for structure and its epistemological consequences witness to a great extent of Kant's viewpoint, and that the idea of organisational stratification today constitutes a different breeding ground within which complexity issues are raised. The various approaches of complexity in biological systems are captured in terms of two different styles, universalism and (weak and strong) constructivism, between which hybrid forms exist. (shrink)

A short review of complexity research from the perspective of history and philosophy of biology is presented. Complexity and its emergence has scientific and metaphysical meanings. From its beginning, biology was a science of complex systems, but with the advent of electronic computing and the possibility of simulating mathematical models of complicated systems, new intuitions of complexity emerged, together with attempts to devise quantitative measures of complexity. But can we quantify the complex?

Complexity theory challenges educational philosophy to reconsider accepted paradigms of teaching, learning and educational research. However, though attractive, not least because of its critique of positivism, its affinity to Dewey and Habermas, and its arguments for openness, diversity, relationships, agency and creativity, the theory is not without its difficulties. These are seen to lie in terms of complexity theory's nature, status, methodology, utility and contribution to the philosophy of education, being a descriptive theory that is easily misunderstood as (...) a prescriptive theory, silent on key issues of values and ethics that educational philosophy should embrace, of questionable internal consistency, and of limited ‘added value’ in educational philosophy. The paper sets out key tenets of complexity theory and argues that, though it is useful for educational philosophy, it requires new conceptual tools and mind‐sets to comprehend fully its significance. (shrink)

The main claim of this paper is that notions of implementation based on an isomorphic correspondence between physical and computational states are not tenable. Rather, ``implementation'' has to be based on the notion of ``bisimulation'' in order to be able to block unwanted implementation results and incorporate intuitions from computational practice. A formal definition of implementation is suggested, which satisfies theoretical and practical requirements and may also be used to make the functionalist notion of ``physical realization'' precise. The upshot of (...) this new definition of implementation is that implementation cannot distinguish isomorphic bisimilar from non-isomporphic bisimilar systems anymore, thus driving a wedge between the notions of causal and computational complexity. While computationalism does not seem to be affected by this result, the consequences for functionalism are not clear and need further investigations. (shrink)

Concerns with the use of engineering approaches in biology have recently been raised. I examine two related challenges to biological research that I call the synchronic and diachronic underdetermination problem. The former refers to challenges associated with the inference of design principles underlying system capacities when the synchronic relations between lower-level processes and higher-level systems capacities are degenerate. The diachronic underdetermination problem regards the problem of reverse engineering a system where the non-linear relations between system capacities and lower-level mechanisms are (...) changing over time. Braun and Marom argue that recent insights to biological complexity leave the aim of reverse engineering hopeless - in principle as well as in practice. While I support their call for systemic approaches to capture the dynamic nature of living systems, I take issue with the conflation of reverse engineering with naïve reductionism. I clarify how the notion of design principles can be more broadly conceived and argue that reverse engineering is compatible with a dynamic view of organisms. It may even help to facilitate an integrated account that bridges the gap between mechanistic and systems approaches. (shrink)

Our aim is to discover whether the notion of algorithmic orbit-complexity can serve to define “chaos” in a dynamical system. We begin with a mostly expository discussion of algorithmic complexity and certain results of Brudno, Pesin, and Ruelle (BRP theorems) which relate the degree of exponential instability of a dynamical system to the average algorithmic complexity of its orbits. When one speaks of predicting the behavior of a dynamical system, one usually has in mind one or more (...) variables in the phase space that are of particular interest. To say that the system is unpredictable is, roughly, to say that one cannot feasibly determine future values of these variables from an approximation of the initial conditions of the system. We introduce the notions of restrictedexponential instability and conditionalorbit-complexity, and announce a new and rather general result, similar in spirit to the BRP theorems, establishing average conditional orbit-complexity as a lower bound for the degree of restricted exponential instability in a dynamical system. The BRP theorems require the phase space to be compact and metrizable. We construct a noncompact kicked rotor dynamical system of physical interest, and show that the relationship between orbit-complexity and exponential instability fails to hold for this system. We conclude that orbit-complexity cannot serve as a general definition of “chaos.”. (shrink)

It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is Π1T-complete. In this connection, the techniques of a uniform partial truth definition for intuitionistic arithmetic theories is used. The main theorem is applied to the characterization of the predicate logic corresponding to certain variant of the notion of realizable predicate formula. Namely, it is shown that the set of irrefutable predicate formulas is recursively isomorphic to the complement of (...) the set ︀. The notion of Σn-realizability is defined on the basis of the notion of Σn-function. It is proved that the predicate logic of Σn-realizability is Πω+1-hard. (shrink)

This article locates a theoretical reflection on the form of legal subjectivity against twenty-first century complexities and pressures, including the structural complexities visible in biotechnological developments, new hybridities and numerous contemporary theoretical and practical manifestations of heterogeneity, multiplicity and complexity emerging in a range of disciplines, including cybernetics, techno-theory, post-humanism and ecology. The author defends the theoretical and critical utility of understanding the legal subject as an explicit (and explicitly limited ) constructus . Criticising the constructed naturalism (and the (...) historical and contemporary exclusions) of the 'human being' of law, the author suggests that the language and concept of the 'legal entity' (rather than that of the 'legal person') draws attention to the patterned 'gap' between law and life (and to related injustices enacted by the form of the materialisation of legal subjectivity) while simultaneously providing the degree of theoretical plasticity now required by the mutable complexities of the twenty-first century and beyond. (shrink)

The relationship between intelligent systems and their environment is at the forefront of research in cognitive science. The Unexplained Intellect: Complexity, Time, and the Metaphysics of Embodied Thought shows how computational complexity theory and analytic metaphysics can together illuminate long-standing questions about the importance of that relationship. It argues that the most basic facts about a mind cannot just be facts about mental states, but must include facts about the dynamic, interactive mental occurrences that take place when a (...) creature encounters its environment. In a discussion that is organised into four clear parts, Christopher Mole begins by examining the mathematics of computational complexity, arguing that the results from complexity theory create a puzzle about how human intelligence could possibly be explained. Mole then uses the tools of analytic metaphysics to draw a distinction between mental states and dynamic mental entities, and shows that, in order to answer the complexity-theoretic puzzle, dynamic entities must be understood to be among the most basic of mental phenomena. The picture of the mind that emerges has important implications for our understanding of intelligence, of action, and of the mind’s relationship to the passage of time. The Unexplained Intellect is the first book to bring insights from the mathematics of computational complexity to bear in an enquiry into the metaphysics of the mind. It will be essential reading for scholars and researchers in the philosophy of mind and psychology, for cognitive scientists, and for those interested in the philosophical importance of complexity. (shrink)

The corporation's social role is usually presented as a cultural phenomenon in which the corporation learns socially acceptable behaviors through voluntary social responsibility, government regulations/public policies, and/or acceptance of ethics principles. This article presents an alternative view of corporationcommunity relations as a natural phenomenon based on complexity-chaos theory and a biological-physical conception of corporate values. Corporation and community are depicted as interacting nonlinear adaptive systems having unpredictable futures, the corporate social role is depicted as largely indeterminate, and competing values (...) are depicted as key factors driving change in corporationcommunity linkages. Normative duties of corporate and community leaders are described. (shrink)

This book asks not only how the study of white-collar crime can enrich our understanding of crime and justice more generally, but also how criminological ...

Multi-stakeholder partnerships have become a major driver to attain the United Nations Sustainable Development Goals. However, managing MSPs is difficult because of the multiple complexities they involve. We seek to contribute to a better understanding of how MSPs cope with these complexities by exploring the MSP scope. In our study of four global health MSPs, we find that a function-oriented scope in terms of focusing on a single intervention helped filter the relevant external and internal complexities, whereas an issue-oriented scope (...) focused on addressing the health issue with multiple interventions magnified the complexities. As a result, the latter MSPs became overwhelmed and self-absorbed, while the former MSPs managed to remain outward-looking and sustain their collaborative energy and support. On this basis, we identify three mechanisms through which the MSP scope either helped or hampered the ability to cope with complexity, and we discuss the theoretical and practical implications for MSPs addressing the SDGs. (shrink)

Let$ \le _c $be computable the reducibility on computably enumerable equivalence relations. We show that for every ceerRwith infinitely many equivalence classes, the index sets$\left\{ {i:R_i \le _c R} \right\}$,$\left\{ {i:R_i \ge _c R} \right\}$, and$\left\{ {i:R_i \equiv _c R} \right\}$are${\rm{\Sigma }}_3^0$complete, whereas in caseRhas only finitely many equivalence classes, we have that$\left\{ {i:R_i \le _c R} \right\}$is${\rm{\Pi }}_2^0$complete, and$\left\{ {i:R \ge _c R} \right\}$ is${\rm{\Sigma }}_2^0$complete. Next, solving an open problem from [1], we prove that the index set of (...) the effectively inseparable ceers is${\rm{\Pi }}_4^0$complete. Finally, we prove that the 1-reducibility preordering on c.e. sets is a${\rm{\Sigma }}_3^0$complete preordering relation, a fact that is used to show that the preordering relation$ \le _c $on ceers is a${\rm{\Sigma }}_3^0$complete preordering relation. (shrink)

The numerically definite syllogistic is the fragment of English obtained by extending the language of the classical syllogism with numerical quantifiers. The numerically definite relational syllogistic is the fragment of English obtained by extending the numerically definite syllogistic with predicates involving transitive verbs. This paper investigates the computational complexity of the satisfiability problem for these fragments. We show that the satisfiability problem (= finite satisfiability problem) for the numerically definite syllogistic is strongly NP-complete, and that the satisfiability problem (= (...) finite satisfiability problem) for the numerically definite relational syllogistic is NEXPTIME-complete, but perhaps not strongly so. We discuss the related problem of probabilistic (propositional) satisfiability, and thereby demonstrate the incompleteness of some proof-systems that have been proposed for the numerically definite syllogistic. (shrink)

The class \ of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of \ nor the first order theory of \ are decidable. Moreover, we show that the set of all equations valid in \ is exactly on the \ level. We consider the class \ of the relation algebra reducts of \ ’s, (...) as well. We prove that the equational theory of \ is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work. (shrink)

(1983). Consciousness and complexity: Evolutionary perspectives on the mind-body problem. Australasian Journal of Philosophy: Vol. 61, No. 4, pp. 378-395.

I defend the prospect of good science in the social sciences by looking at the obstacles to social laws. I criticize traditional approaches, which rule for or against social laws on primarily conceptual grounds, and argue that only a close analysis of actual empirical research can decide the issue. To that end, I focus on problems caused by the ceteris paribus nature of social generalizations, outline a variety of ways those problems might be handled, and then examine in detail the (...) work of Paige on agrarian revolutions. Paige's work, I argue, handles its problems roughly as well as does some of the best work in evolutionary biology. The upshot is that some social laws can be relatively well confirmed. (shrink)