We make two suggestions with regard to Depue & Collins's target article. First, regarding the functioning of MOC13, we provide data indicating that, contrary to D&C's apparent position, this structure is not necessary for instrumental conditioning. Second, we suggest that D&C's approach would be advanced by reference to formal computational theory, in particular the work of Grossberg. We suggest that an integration of Grossberg 's and D&C's models can provide a more complete account of extraversion.

We define the effective integrability of Fine-computable functions and effectivize some fundamental limit theorems in the theory of Lebesgue integrals such as the Bounded Convergence Theorem, the Dominated Convergence Theorem, and the Second Mean Value Theorem. It is also proved that the Walsh-Fourier coefficients of an effectively integrable Fine-computable function form a Euclidian computable sequence of reals which converges effectively to zero. This property of convergence is the effectivization of the Walsh-Riemann-Lebesgue Theorem. The article is closed with the effective (...) version of Dirichlet's test. (shrink)

Epstein and Carnielli's fine textbook on logic and computability is now in its second edition. The readers of this journal might be particularly interested in the timeline `Computability and Undecidability' added in this edition, and the included wall-poster of the same title. The text itself, however, has some aspects which are worth commenting on.

This paper describes the application of eight statistical and machine-learning methods to derive computer models for predicting mortality of hospital patients with pneumonia from their findings at initial presentation. The eight models were each constructed based on 9847 patient cases and they were each evaluated on 4352 additional cases. The primary evaluation metric was the error in predicted survival as a function of the fraction of patients predicted to survive. This metric is useful in assessing a model’s potential to (...) assist a clinician in deciding whether to treat a given patient in the hospital or at home. We examined the error rates of the models when predicting that a given fraction of patients will survive. We examined survival fractions between 0.1 and 0.6. Over this range, each model’s predictive error rate was within 1% of the error rate of every other model. When predicting that approximately 30°K of the patients will survive, all the models have an error rate of less than 1.5%. The models are distinguished more by the number of variables and parameters that they contain than by their error rates; these differences suggest which models may be the most amenable to future implementation as paper-based guidelines. (shrink)

In this paper we consider the emerging position in metaphysics that artifact functions characterize real kinds of artifacts. We analyze how it can circumvent an objection by David Wiggins (Sameness and substance renewed, 2001, 87) and then argue that this position, in comparison to expert judgments, amounts to an interesting fine-grained metaphysics: taking artifact functions as (part of the) essences of artifacts leads to distinctions between principles of activity of artifacts that experts in technology have not yet made. We show, (...) moreover, that our argument holds not only in the artifactual realm but also in biology: taking biological functions as (part of the) essences of organs leads to distinctions between principles of activity of organs that biological experts have not yet made. We run our argument on the basis of analyses of artifact and biological functions as developed in philosophy of technology and of biology, thus importing results obtained outside of metaphysics into the debate on ontological realism. In return, our argument shows that a position in metaphysics provides experts reason for trying to detect differences between principles of activities of artifacts and organs that have not been detected so far. (shrink)

In the late 1960s and early 1970s David Marr produced three astonishing papers in which he gave a detailed account of how the fine structure and known cell types of the cerebellum, hippocampus and neocortex perform the functions that they do. Marr went on to become one of the main founders of Computational Neuroscience. In his classic work 'Vision' he distinguished between the computational, algorithmic, and implementational levels, and the three early theories concerned implementation. However, they were produced when Neuroscience (...) was in its infancy.Now that so much more is known, it is timely to revisit these early theories to see to what extent they are still valid and what needs to be altered to produce viable theories that stand up to current evidence. This book brings together some of the most distinguished scientists in their fields to evaluate Marr's legacy. (shrink)

Coarse-grain models are essential to understand the biological function of DNA molecules because the length and time scales of the sequence-dependent physical properties of DNA are often beyond the reach of experimental and all-atom computational methods. Simulating coarse-grain models of DNA, e.g. using Langevin dynamics, requires the parametrization of both potential and kinetic energy functions. Many studies have shown that the flexibility (i.e., potential energy) of a DNA molecule depends on its sequence. In contrast, little is known about the (...) sequence-dependence of DNA mass parameters required to model its kinetic energy. In this paper, an algebraic expression is derived for the kinetic energy as a function of linear and angular velocities of each DNA base parameterized by its mass, center of mass, and rotational inertia tensor. The parameters of this function are then approximated from a set of fine-grain molecular dynamics simulations representing all combinations of the four DNA base pairs AT, TA, GC, and CG, in different sequence contexts. Compatibility conditions associated with the assumption of each base being modeled as a rigid body were verified to be good approximations. The kinetic parameters were found to be significantly different between the four G, C, A, and T bases, and to not be dependent on the sequence context. This suggests that the effective kinetic parameters of a DNA base may depend only on the base itself, not on its neighbors. (shrink)

Architecture often relies on mathematical models, if only to anticipate the physical behavior of structures. Accordingly, mathematical modeling serves to find an optimal form given certain constraints, constraints themselves translated into a language which must be homogeneous to that of the model in order for resolution to be possible. Traditional modeling tied to design and architecture thus appears linked to a topdown vision of creation, of the modernist, voluntarist and uniformly normative type, because usually (mono)functionalist. One available instrument of calculation/representation/prescription (...) orders this conception of architecture: indeed the search for an optimal solution through mathematical calculation of a model itself mathematical, thus homogeneous and simple, is only possible when one or two functions or functional constraints are formulated, never more, and this, on a global level, therefore starting from a unique and homogenizing viewpoint. It is essential to grasp that, even applied to material and its properties or towards a particular esthetic or functional dimension, this viewpoint is thus abstractive and generalizing: disregarding singularity of context, insertion and relationship to the environment or local, social behavior. It leaves aside functional specificity and heterogeneousness – re-contextualized each time – of functions that the object or edifice are required to fulfill and optimize under diverse constraints, in their different parts. The computational turning point today’s digital design and computational architecture embody modifies these instrumental, original prescriptions, rendering them more flexible. Perhaps in light of this turnabout we should retrospectively interpret 20th century calls for modernism, functionalism and even biomorphism as being just as many ex post rationalizations in respect to techniques of strongly prescriptive modeling since our only instrument is a monolithic language, and so being, incites a top-down conception, (naturally weakly reactive to contexts), including forms whose overall appearance resembles in fine a living form. In order to liberate oneself from this and despite everything, emerge as its initiators, one has constructed from ideology and philosophy (of object, habitat, the urban) ex post, even while it is the instrument of modeling and conception that largely determines, normalizes and dictates ex ante, the possibilities and limitations of the creation of forms and living experiments4 in a given time. (shrink)

A single case study of a patient, D.M., with a lesion in the region of the right occipito-temporal gyrus is presented. D.M. had well-preserved language and general cognitive abilities. Colour discrimination, contrast sensitivity, gross depth perception, spatial localization, and motion appreciation were within normal limits.On the evaluation of perceptual abilities, he failed to identify two-dimensional shapes from stereoscopic vision, motion, and texture although in all cases he was able to identify the rough area subtended by the shape. These findings are (...) considered in relation to the current anatomical-physiological functional models of vision and it is suggested that D.M. 's deficits provide evidence for the existence in man of a functional pathway involved in the computation of texture and fine aspects of shape, which is distinct from the pathways involved in motion and stereopsis processing on one hand and colour and coarse aspects of form on the other hand. (shrink)

One of the most debated questions in psychology and cognitive science is the nature and the functioning of the mental processes involved in deductive reasoning. However, all existing theories refer to a specific deductive domain, like syllogistic, propositional or relational reasoning.Our goal is to unify the main types of deductive reasoning into a single set of basic procedures. In particular, we bring together the microtheories developed from a mental models perspective in a single theory, for which we provide a formal (...) foundation. We validate the theory through a computational model (UNICORE) which allows fine‐grained predictions of subjects' performance in different reasoning domains.The performance of the model is tested against the performance of experimental subjects—as reported in the relevant literature—in the three areas of syllogistic, relational and propositional reasoning. The computational model proves to be a satisfactory artificial subject, reproducing both correct and erroneous performance of the human subjects. Moreover, we introduce a developmental trend in the program, in order to simulate the performance of subjects of different ages, ranging from children (3–6) to adolescents (8–12) to adults (>21). The simulation model performs similarly to the subjects of different ages.Our conclusion is that the validity of the mental model approach is confirmed for the deductive reasoning domain, and that it is possible to devise a unique mechanism able to deal with the specific subareas. The proposed computational model (UNICORE) represents such a unifying structure. (shrink)

The effectiveness of evolutionary algorithms is one of the issues discussed in The Compatibility of Evolution and Design, where it is argued that such algorithms are only effective when stringent preconditions are met. This article considers this issue from the perspective of computer science. It explores the properties of problems that can be effectively solved by evolutionary algorithms, and the extent to which such algorithms need to be carefully adjusted. Although there are important differences between the study of evolutionary algorithms (...) in computer science and the study of biological evolution, it is argued that the experience of computer science can help to strengthen the claim that evolutionary mechanisms generally require a considerable degree of fine-tuning. (shrink)

Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and "nearly" minimal size, i.e., within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. A lim-computablefunction is (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its (...) output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonious final programs by use of criteria which require the final, correct programs to be "not-so-nearly" minimal size, e.g., to be within a lim-computable function of actual minimal size. It is shown that some parsimony in the final program is thereby retained, yet learning power strictly increases. Considered, then, are lim-computable functions as above but for which notations for constructive ordinals are used to bound the number of mind changes allowed regarding the output. This is a variant of an idea introduced by Freivalds and Smith. For this ordinal notation complexity bounded version of lim-computability, the power of the resultant learning criteria form finely graded, infinitely ramifying, infinite hierarchies intermediate between the computable and the lim-computable cases. Some of these hierarchies, for the natural notations determining them, are shown to be optimally tight. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:The Fine Delight that Fathers Thought: Rhetoric and Medievalism in Gerard Manley HopkinsRichard D. LordThe Fine Delight that Fathers Thought: Rhetoric and Medievalism in Gerard Manley Hopkins, by Franco Marucci; 261 pp. Washington, D.C.: Catholic University of America Press, 1994, $44.95.Paging one day through Hopkins’s notebooks in the library at Campion Hall, I was startled to find the draft of “Spelt From Sibyl’s Leaves” placed directly opposite the (...) tortuous grade computations for one of his classes. This book presents a similar contrast—insights into “The Wreck of the Deutschland” buried in the technical language of structuralism, semiotics, and rhetoric.In his preface, the author calls his book “a revised and updated translation of my I fogli della Sibilla. Retorica et medievalismo in Gerard Manley Hopkins” (p. ix). As the title indicates, it is divided into two parts, the former dealing with Hopkins’s poetic rhetoric viewed synchronically and the latter with his “textuality as a confluence of... cultural codes” (p. 89).In the chapter introducing part one, Marucci dismisses, with few exceptions, criticism from 1918 to the present as being of little use to one investigating “the function and functionality of Hopkins’s poetic rhetoric” (p. 3). The exemplifying portion of this chapter (“Amplification”) addresses “God’s Grandeur” and “The Wreck of the Deutschland” as judicial speech (persuasive), with the reader performing the judicial function. The analysis is useful in providing insights into the poet’s rhetorical planning as he guides the reader in this persuasive process.Moving from the “Deutschland” to the “terrible sonnets” as exemplifications of “autocommunication,” Marucci notes that here the interlocutor gradually disappears as the sender-receiver relationship fades. He believes that Hopkins became “no longer capable of finding in himself (or, more probably, of offering to a receiver who had proved cold and indifferent) the necessary stimuli” (p. 76) and names the editor of The Month, Bridges, and other correspondents as the probable receivers.In the second (and major) part of the book, the author sets out to examine the cultural codes influencing the poet’s textuality. The chapter introducing this section, “‘Integrated’ and ‘Apocalyptic’ Writers,” first looks at “the global syntagmatic model of the Victorian Age” (p. 98) and then divides its texts according to this model into three categories. The first two either reflect or modify the syntagmatic codes (“integrated” writers) while the third opposes these codes (“apocalyptic” writers). The author’s thesis is that Hopkins is not fully any one of these, but that his Victorianism is subsumed in various ways and ultimately subordinated to his medievalism. His position is that Victorian codes essentially ceased to affect the poet after his entrance into the Society of Jesus, when they were replaced by medieval codes. This is developed in some detail in the chapter entitled “Hopkins and Duns Scotus.”Although the book takes a narrow critical approach to Hopkins, it still might [End Page 149] well have been enriched by allowing for the ways in which the Ignatian method of meditation, with its emphasis on the “application of the senses,” so clearly drew Hopkins to find a kindred spirit in Scotus. This, together with the kind of seminary training in vogue in the Catholic Church until after Vatican II, certainly contributed to the medievalism that Marucci finds in the later Hopkins.This is a useful and provocative book for scholars, but many of the footnotes seem unnecessarily long and some chapters conclude too abruptly. The highly specialized language of structuralism and semiotics requires an expertise that probably eludes most undergraduate students.Richard D. LordWillamette UniversityCopyright © 1995 The Johns Hopkins University Press... (shrink)

This article presents a novel full-reference image quality assessment algorithm by depicting the sub-band characteristics in the wavelet domain. The proposed image quality assessment method is based on energy estimation in the wavelet-transformed image. Image QA is achieved by applying a multilevel wavelet decomposition on both the original and the enhanced image. Next, the wavelet energy and vector are computed to obtain the percentage of the energy that corresponds to the approximation and the details, respectively. Further, the approximate and detailed (...) energy levels of both the original and the enhanced images are compared to formulate an image quality assessment. Numerous experiments are conducted on a dozen of image enhancement algorithms. The results presented show that the image with poor contrast in the foreground than the background has continuous regular coefficient values. The probability density function for such an image has a relatively lower WE and skewness compared with the background. The proposed scheme not only evaluates the global information of an image but also estimates the fine, detailed changes in an enhanced image. Thus, the proposed metric serves as an objective and effective FR criterion for color image QA. The experimental results presented confirm that the proposed WE metric is an efficient and useful metric for evaluating the quality of the color image enhancement. (shrink)

It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial Π10 subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise computability. As for nonempty Π10 subsets of Cantor space, we show the existence of a finite-Δ20-piecewise degree containing infinitely many finite-2-piecewise degrees, and a finite-2-piecewise degree containing infinitely many finite-Δ20-piecewise degrees 2 denotes the difference of two Πn0 sets), whereas the greatest degrees in (...) these three “finite-Γ-piecewise” degree structures coincide. Moreover, as for nonempty Π10 subsets of Cantor space, we also show that every nonzero finite-2-piecewise degree includes infinitely many Medvedev degrees, every nonzero countable-Δ20-piecewise degree includes infinitely many finite-piecewise degrees, every nonzero finite-2-countable-Δ20-piecewise degree includes infinitely many countable-Δ20-piecewise degrees, and every nonzero Muchnik degree includes infinitely many finite-2-countable-Δ20-piecewise degrees. Indeed, we show that any nonzero Medvedev degree and nonzero countable-Δ20-piecewise degree of a nonempty Π10 subset of Cantor space have the strong anticupping properties. Finally, we obtain an elementary difference between the Medvedev degree structure and the finite-Γ-piecewise degree structure of all subsets of Baire space by showing that none of the finite-Γ-piecewise structures is Brouwerian, where Γ is any of the Wadge classes mentioned above. (shrink)

Recent debates about the biological and evolutionary conditions for sentience have generated a renewed interest in fine-grained functionalism. According to one such account advanced by Peter Godfrey-Smith, sentience depends on the fine-grained activities characteristic of living organisms. Specifically, the scale, context and stochasticity of these fine-grained activities. One implication of this view is that contemporary artificial intelligence is a poor candidate for sentience. Insofar as current AI lacks the ability to engage in such living activities it will lack sentience, no (...) matter what its coarse-grained functions. In this paper, we review the case for fine-grained functionalism and show that there are contemporary machines that fulfil the fine-grained functional criteria identified by Godfrey-Smith, and thus are candidates for sentience. Molecular machines such as Brownian computers are analogous to metabolic activity in their scale, context and stochasticity, and can serve as the basis of AI. Molecular computation is a promising candidate for artificial sentience according to contemporary philosophical accounts of sentience. (shrink)

Quantum mechanical measurements on a physical system are represented by observables - Hermitian operators on the state space of the observed system. It is an important question whether all observables may be realized, in principle, as measurements on a physical system. Dirac’s influential text ( [1], page 37) makes the following assertion on the question: The question now presents itself – Can every observable be measured? The answer theoretically is yes. In practice it may be very awkward, or perhaps even (...) beyond the ingenuity of the experimenter, to devise an apparatus which could measure some particular observable, but the theory always allows one to imagine that the measurement can be made. This Letter re-examines the question of whether it is possible, even in principle, to measure every quantum mechanical observable. Unexpectedly, ideas from com-. (shrink)

This book is dedicated to a classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient (...) formal logic to give a full development of Gödel's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics". (shrink)

Using episodes in the history of the interpretation of the psi-function, this paper addresses the question of how the understanding of science sought by philosophy of science relates to the understanding sought by science itself. This leads to a conception of the discipline of philosophy of science as an historical entity. The paper concludes by drawing out the implications of that conception for our role in the humanities, and our relationship to the sciences and to ongoing scientific work.

This is an annotated reading list on the beginning elements of the theory of computable functions. It is now structured so as to complement the first eight lectures of Thomas Forster’s Part III course in Lent 2011 (see the first four chapters of his evolving handouts).

The neuroscientific investigation of sex differences has an unsavoury past, in which scientific claims reinforced and legitimated gender roles in ways that were not scientifically justified. Feminist critics have recently argued that the current use of functional neuroimaging technology in sex differences research largely follows that tradition. These charges of ‘neurosexism’ have been countered with arguments that the research being done is informative and valuable and that an over-emphasis on the perils, rather than the promise, of such research threatens to (...) hinder scientific progress. To investigate the validity of these contrasting concerns, recent functional magnetic resonance imaging (fMRI) investigations of sex differences and citation practices were systematically examined. In line with the notion of neurosexism, the research was found to support the influence of false-positive claims of sex differences in the brain, to enable the proliferation of untested, stereotype-consistent functional interpretations, and to pay insufficient attention to the potential plasticity of sex differences in both brain and mind. This, it is argued, creates a literature biased toward the presentation of sex differences in the brain as extensive, functionally significant, and fixed—and therefore implicitly supportive of a gender essentialist perspective. It is suggested that taking feminist criticisms into account would bring about substantial improvement in the quality of the science, as well as a reduction in socially harmful consequences. (shrink)

In the May 15, 1935 issue of Physical Review Albert Einstein co-authored a paper with his two postdoctoral research associates at the Institute for Advanced Study, Boris Podolsky and Nathan Rosen. The article was entitled “Can Quantum Mechanical Description of Physical Reality Be Considered Complete?” (Einstein et al. 1935). Generally referred to as “EPR”, this paper quickly became a centerpiece in the debate over the interpretation of the quantum theory, a debate that continues today. The paper features a striking case (...) where two quantum systems interact in such a way as to link both their spatial coordinates in a certain direction and also their linear momenta (in the same direction). As a result of this “entanglement”, determining either position or momentum for one system would fix (respectively) the position or the momentum of the other. EPR use this case to argue that one cannot maintain both an intuitive condition of local action and the completeness of the quantum description by means of the wave function. This entry describes the argument of that 1935 paper, considers several different versions and reactions, and explores the ongoing significance of the issues they raise. (shrink)

It is my aim in this paper to show that the contemporary assimilation of essence to modality is fundamentally misguided and that, as a consequence, the corresponding conception of metaphysics should be given up. It is not my view that the modal account fails to capture anything which might reasonably be called a concept of essence. My point, rather, is that the notion of essence which is of central importance to the metaphysics of identity is not to be understood in (...) modal terms or even to be regarded as extensionally equivalent to a modal notion. The one notion is, if I am right, a highly refined version of the other; it is like a sieve which performs a similar function but with a much finer mesh. (shrink)

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable set functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.

There is a well-known argument from Leibniz's Law for the view that coincident material things may be distinct. For given that they differ in their properties, then how can they be the same? However, many philosophers have suggested that this apparent difference in properties is the product of a linguistic illusion; there is just one thing out there, but different sorts or guises under which it may be described. I attempt to show that this ‘opacity’ defence has intolerable consequences for (...) the functioning of our language and that the original argument should therefore be allowed to stand. (shrink)

As is well known the derivative of a computable and C1 function may not be computable. For a computable and C∞ function f, the sequence {f} of its derivatives may fail to be computable as a sequence, even though its derivative of any order is computable. In this paper we present a necessary and sufficient condition for the sequence {f} of derivatives of a computable and C∞ function f to be computable. We also give a sharp regularity (...) condition on an initial computable function f which insures the computability of its derivative f′. (shrink)

This study provides evidence for implicit learning in syntactic comprehension. By reanalyzing data from a syntactic priming experiment (Thothathiri & Snedeker, 2008), we find that the error signal associated with a syntactic prime influences comprehenders' subsequent syntactic expectations. This follows directly from error‐based implicit learning accounts of syntactic priming, but it is unexpected under accounts that consider syntactic priming a consequence of temporary increases in base‐level activation. More generally, the results raise questions about the principles underlying the maintenance of implicit (...) statistical knowledge relevant to language processing, and about possible functional motivations for syntactic priming. (shrink)

Horsten and Roelants have raised a number of important questions about my analysis of effective procedures and my evaluation of the Church-Turing thesis. They suggest that, on my account, effective procedures cannot enter the mathematical world because they have a built-in component of causality, and, hence, that my arguments against the Church-Turing thesis miss the mark. Unfortunately, however, their reasoning is based upon a number of misunderstandings. Effective mundane procedures do not, on my view, provide an analysis of ourgeneral concept (...) of an effective procedure; mundane procedures and Turing machine procedures are different kinds of procedure. Moreover, the same sequence ofparticular physical action can realize both a mundane procedure and a Turing machine procedure; it is sequences of particular physical actions, not mundane procedures, which enter the world of mathematics. I conclude by discussing whether genuinely continuous physical processes can enter the world of real numbers and compute real-valued functions. I argue that the same kind of correspondence assumptions that are made between non-numerical structures and the natural numbers, in the case of Turing machines and personal computers, can be made in the case of genuinely continuous, physical processes and the real numbers. (shrink)

"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by (...) Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed. (shrink)

Computer science advocates institutional frameworks as an effective tool for modelling policies and reasoning about their interplay. In practice, the rules or policies, of which the institutional framework consists, are often specified using a formal language, which allows for the full verification and validation of the framework (e.g. the consistency of policies) and the interplay between the policies and actors (e.g. violations). However, when modelling large-scale realistic systems, with numerous decision-making entities, scalability and complexity issues arise making it possible only (...) to verify certain portions of the problem without reducing the scale. In the social sciences, agent-based modelling is a popular tool for analysing how entities interact within a system and react to the system properties. Agent-based modelling allows the specification of complex decision-making entities and experimentation with large numbers of different parameter sets for these entities in order to explore their effects on overall system performance. In this paper we describe how to achieve the best of both worlds, namely verification of a formal specification combined with the testing of large-scale systems with numerous different actor configurations. Hence, we offer an approach that allows for reasoning about policies, policy making and their consequences on a more comprehensive level than has been possible to date. We present the institutional agent-based model methodology to combine institutional frameworks with agent-based simulations). We furthermore present J-InstAL, a prototypical implementation of this methodology using the InstAL institutional framework whose specifications can be translated into a computational model under the answer set semantics, and an agent-based simulation based on the jason tool. Using a simplified contract enforcement example, we demonstrate the functionalities of this prototype and show how it can help to assess an appropriate fine level in case of contract violations. (shrink)

: Fodor’s view of the mind is thoroughly computational. This means that the basic kind of mental entity is a “discursive” mental representation and operations over this kind of mental representation have broad architectural scope, extending out to the edges of perception and the motor system. However, in multiple epochs of his work, Fodor attempted to define a functional role for non-discursive, imagistic representation. I describe and critique his two considered proposals. The first view says that images play a particular (...) kind of functional role in certain types of deliberative tasks. The second says that images are solely restricted to the borders of perception, and act as a sort of medium for the fixing of conceptual reference. I argue, against the first proposal, that a broad-scope computationalism such as Fodor’s renders images in principle functionally redundant. I argue, against the second proposal, that empirical evidence suggests that non-discursive representations are learned through perceptual learning, and directly inform category judgments. In each case, I point out extant debates for which the arguments are relevant. The upshot is that there is motivation for limited scope computationalism, in which some, but not all, mental processes operate on discursive mental representations. Keywords: Computational Theory of Mind; Mental Representation; Perception; Mental Image; Jerry Fodor Fodor e le rappresentazioni mentali come immagini Riassunto: La concezione della mente di Fodor è rigorosamente computazionale, ossia le entità mentali di base sono rappresentazioni mentali “discorsive”. Le operazioni su queste rappresentazioni hanno un fine architettonico ampio, che va fino ai confini della percezione e del sistema motorio. In periodi diversi del suo lavoro, Fodor ha proposto due modi per definire un ruolo funzionale per la rappresentazione non-discorsiva come immagine. Tratterò criticamente entrambi. Per il primo, le immagini giocano un particolare tipo di ruolo funzionale in certi tipi di compiti deliberativi, mentre, per il secondo, sono relegate unicamente ai confini della percezione, agendo come medium per fissare il riferimento concettuale. Contro il primo sosterrò che un computazionalismo così ampio come quello di Fodor rende le immagini in principio funzionalmente ridondanti. Contro il secondo sosterrò che l’evidenza empirica suggerisce che le rappresentazioni non-discorsive vengono apprese percettivamente, agendo direttamente sui giudizi di categorizzazione. In entrambi i casi considererò gli argomenti più rilevanti nel dibattito corrente. Si vedrà che ci sono buone ragioni in favore di un computazionalismo più limitato, in cui alcuni processi mentali operano su rappresentazioni mentali discorsive. Parole chiave: Teoria computazionale della mente; Rappresentazione mentale; Percezione; Immagine mentale; Jerry Fodor. (shrink)

This paper establishes a sound and complete semantics for the impure logic of ground. Fine (Review of Symbolic Logic, 5(1), 1–25, 2012a) sets out a system for the pure logic of ground, one in which the formulas between which ground-theoretic claims hold have no internal logical complexity; and it provides a sound and complete semantics for the system. Fine (2012b) [§§6-8] sets out a system for an impure logic of ground, one that extends the rules of the original pure system (...) with rules for the truth-functional connectives, the first-order quantifiers, and λ-abstraction. However, no semantics has yet been provided for this system. The present paper partly fills this lacuna by providing a sound and complete semantics for a system GG containing the truth-functional operators that is closely related to the truth-functional part of the system of Fine (2012b). (shrink)

The increasing use of Artificial Intelligence for making decisions in public affairs has sparked a lively debate on the benefits and potential harms of self-learning technologies, ranging from the hopes of fully informed and objectively taken decisions to fear for the destruction of mankind. To prevent the negative outcomes and to achieve accountable systems, many have argued that we need to open up the “black box” of AI decision-making and make it more transparent. Whereas this debate has primarily focused on (...) how transparency can secure high-quality, fair, and reliable decisions, far less attention has been devoted to the role of transparency when it comes to how the general public come to perceive AI decision-making as legitimate and worthy of acceptance. Since relying on coercion is not only normatively problematic but also costly and highly inefficient, perceived legitimacy is fundamental to the democratic system. This paper discusses how transparency in and about AI decision-making can affect the public’s perception of the legitimacy of decisions and decision-makers and produce a framework for analyzing these questions. We argue that a limited form of transparency that focuses on providing justifications for decisions has the potential to provide sufficient ground for perceived legitimacy without producing the harms full transparency would bring. (shrink)

This chapter contains section titled: The Antinomy of the Variable The Tarskian Approach The Rejection of Semantic Role The Instantial Approach The Algebraic Approach The Relational Approach Relational Semantics for First‐order Logic.

This paper addresses the “inefficiency loophole” in the Bell theorem. We examine factorizable stochastic models for the Bell inequalities, where we allow the detection efficiency to depend both on the “hidden” state of the measured system and also its passage through an analyzer. We show that, nevertheless, if the efficiency functions are symmetric between the two wings of the experiment, one can dispense with supplementary assumptions and derive new inequalities that enable the models to be tested even for highly inefficient (...) experiments. (shrink)

Foetal neurones transplanted within the adult mammalian central nervous system survive and differentiate. Study of such transplants has yielded insights into the function, development and plasticity of brain structures, and suggests promising new therapies for a number of neurological disorders.

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). (...) Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest. (shrink)

The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether defined in different manners, via function algebras (Real Recursive Functions) or via Turing Machines (Computable Analysis). We provide general tools for investigating these issues, using two techniques we call approximation and lifting. We use these methods to obtain two main theorems. First, we provide an alternative proof of the result from Campagnolo et (...) al. (J Complex 18:977–1000, 2002), which precisely relates the Kalmar elementary computable functions to a function algebra over the reals. Second, we build on that result to extend a result of Bournez and Hainry (Theor Comput Sci 348(2–3):130–147, 2005), which provided a function algebra for the ${\mathcal{C}}^2$ real elementary computable functions; our result does not require the restriction to ${\mathcal{C}}^2$ functions. In addition to the extension, we provide an alternative approach to the proof. Their proof involves simulating the operation of a Turing Machine using a function algebra. We avoid this simulation, using a technique we call lifting, which allows us to lift the classic result regarding the elementary computable functions to a result on the reals. The two new techniques bring a different perspective to these problems, and furthermore appear more easily applicable to other problems of this sort. (shrink)

This paper puts forward the hypothesis that consciousness might be linked to matter in a way which is more sophisticated than the traditional macroscopic Cartesian hypothesis suggests.Advances in the biophysics of the nervous system, not only on the level of its macroscopic functioning but also on the level of individual ion channels, have made the question of how finely consciousness is tied to matter and its dynamics more important. Quantum mechanics limits the attainable resolution and puts into doubt the idea (...) of an infinitely fine-woven attachment. A recent approach to physics rekindles such a rationalist hope. Endophysics focuses on the global implications of microscopic computer simulations of chemical and biophysical processes. A complete artificial universe can be set up in the computer. It produces non-classical and nonlocal effects inside — on the interface that exists between an internal observer (fluid neuron) and the rest of the world. This interface is finer than any brain property to which the status of the mind-body interface has been attributed hitherto. A new class of experiments becomes possible in the artificial world and, by analogy, in the real world. Magnetic resonance imaging experiments, routinely performed under open-loop conditions, can be repeated under psychophysical (closed-loop) conditions — in search for microscopically induced changes in the perceived and measured structure of the world. (shrink)

The meaning of most words in language depends on their context. Understanding how the human brain extracts contextualized meaning, and identifying where in the brain this takes place, remain important scientific challenges. But technological and computational advances in neuroscience and artificial intelligence now provide unprecedented opportunities to study the human brain in action as language is read and understood. Recent contextualized language models seem to be able to capture homonymic meaning variation (“bat”, in a baseball vs. a vampire context), as (...) well as more nuanced differences of meaning—for example, polysemous words such as “book”, which can be interpreted in distinct but related senses (“explain a book”, information, vs. “open a book”, object) whose differences are fine‐grained. We study these subtle differences in lexical meaning along the concrete/abstract dimension, as they are triggered by verb‐noun semantic composition. We analyze functional magnetic resonance imaging (fMRI) activations elicited by Italian verb phrases containing nouns whose interpretation is affected by the verb to different degrees. By using a contextualized language model and human concreteness ratings, we shed light on where in the brain such fine‐grained meaning variation takes place and how it is coded. Our results show that phrase concreteness judgments and the contextualized model can predict BOLD activation associated with semantic composition within the language network. Importantly, representations derived from a complex, nonlinear composition process consistently outperform simpler composition approaches. This is compatible with a holistic view of semantic composition in the brain, where semantic representations are modified by the process of composition itself. When looking at individual brain areas, we find that encoding performance is statistically significant, although with differing patterns of results, suggesting differential involvement, in the posterior superior temporal sulcus, inferior frontal gyrus and anterior temporal lobe, and in motor areas previously associated with processing of concreteness/abstractness. (shrink)

Conscious events interact with memory systems in learning, rehearsal and retrieval (Ebbinghaus 1885/1964; Tulving 1985). Here we present hypotheses that arise from the IDA computional model (Franklin,Kelemen and McCauley 1998; Franklin 2001b) of global workspace theory (Baars 1988, 2002). Our primary tool for this exploration is a flexible cognitive cycle employed by the IDA computational model and hypothesized to be a basic element of human cognitive processing. Since cognitive cycles are hypothesized to occur five to tentimes a second and include (...) interaction between conscious contents and several of the memory systems, they provide the means for an exceptionally fine-grained analysis of various cognitive tasks. We apply this tool to the small effect size of subliminal learning compared to supraliminal learning, to process dissociation, to implicit learning, to recognition vs. recall, and to the availability heuristic in recall. The IDA model elucidates the role of consciousness in the updating of perceptual memory, transient episodic memory, and procedural memory. In most cases, memory is hypothesized to interact with conscious events for its normal functioning. The methodology of the paper is unusual in that the hypotheses and explanations presented are derived from an empirically based, but broad and qualitative computational model of human cognition. (shrink)

Insects have small brains and heuristics or ‘rules of thumb’ are proposed here to be a good model for how insects optimize the objects they make and use. Generally, heuristics are thought to increase the speed of decision making by reducing the computational resources needed for making decisions. By corollary, heuristic decisions are also deemed to impose a compromise in decision accuracy. Using examples from object optimization behavior in insects, we will argue that heuristics do not inevitably imply a lower (...) computational burden or lower decision accuracy. We also show that heuristic optimization may be driven by certain features of the optimization problem itself: the properties of the object being optimized, the biology of the insect, and the properties of the function being optimized. We also delineate the structural conditions under which heuristic optimization may achieve accuracy equivalent to or better than more fine-grained and onerous optimization methods. (shrink)