Degtev, A.N., On p-reducibility of numerations, Annals of Pure and Applied Logic 63 57–60. If α and β are two numerations of a set S, then αpβ if there exists a total recursive function f such that [s ε S][α-1=[x:[y ε Df][Dyβ-1]]], where Dn is a finite set with canonical number n. It is proved that if α and β are two computable numerations of some family of recursively enumerable sets A and αpβ, then there is a computable (...) numeration, γ, of S such that αpγ and βshrink)

A total of 1918 loci, detected by the hybridization of 938 expressed sequence tag unigenes from 26 Triticeae cDNA libraries, were mapped to wheat homoeologous group 4 chromosomes using a set of deletion, ditelosomic, and nulli-tetrasomic lines. The 1918 EST loci were not distributed uniformly among the three group 4 chromosomes; 41, 28, and 31% mapped to chromosomes 4A, 4B, and 4D, respectively. This pattern is in contrast to the cumulative results of EST mapping in all homoeologous groups, as reported (...) elsewhere, that found the highest proportion of loci mapped to the B genome. Sixty-five percent of these 1918 loci mapped to the long arms of homoeologous group 4 chromosomes, while 35% mapped to the short arms. The distal regions of chromosome arms showed higher numbers of loci than the proximal regions, with the exception of 4DL. This study confirmed the complex structure of chromosome 4A that contains two reciprocal translocations and two inversions, previously identified. An additional inversion in the centromeric region of 4A was revealed. A consensus map for homoeologous group 4 was developed from 119 ESTs unique to group 4. Forty-nine percent of these ESTs were found to be homoologous to sequences on rice chromosome 3, 12% had matches with sequences on other rice chromosomes, and 39% had no matches with rice sequences at all. Limited homology was found between wheat ESTs on homoeologous group 4 and the Arabidopsis genome. Forty-two percent of the homoeologous group 4 ESTs could be classified into functional categories on the basis of blastX searches against all protein databases. (shrink)

This report describes the rationale, approaches, organization, and resource development leading to a large-scale deletion bin map of the hexaploid wheat genome. Accompanying reports in this issue detail results from chromosome bin-mapping of expressed sequence tags representing genes onto the seven homoeologous chromosome groups and a global analysis of the entire mapped wheat EST data set. Among the resources developed were the first extensive public wheat EST collection. Described are protocols for sequencing, sequence processing, EST nomenclature, and the assembly of (...) ESTs into contigs. These contigs plus singletons were used for selection of distinct sequence motif unigenes. Selected ESTs were rearrayed, validated by 5′ and 3′ sequencing, and amplified for probing a series of wheat aneuploid and deletion stocks. Images and data for all Southern hybridizations were deposited in databases and were used by the coordinators for each of the seven homoeologous chromosome groups to validate the mapping results. Results from this project have established the foundation for future developments in wheat genomics. (shrink)

An attentional-associative model (Schmajuk et al. 1996), previously evaluated against multiple sets of classical conditioning data, is applied to causal learning. In agreement with Mitchell et al.'s suggestion, according to the model associative learning can be a conscious, controlled process. However, whereas our model correctly predicts blocking following or preceding subadditive training, the propositional approach cannot account for those results.

One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[n] : n ∈ ω) approximating α and (b[n] : n ∈ ω) approximating β and a positive constant C such that for all n, C(α − a[n]) ≥ (β − b[n]). See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin’s Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. (...) Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. We show that every recursively enumerable random real dominates all other recursively enumerable reals. We conclude that the recursively enumerable random reals are exactly the Ω-numbers [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. Second, we show that the sets in a universal Martin-Lof test for randomness have random measure, and every recursively enumerable random number is the sum of the measures represented in a universal Martin-Lof test. (shrink)

Automated Software Testing (AST) using Model Checking is in this article epistemologically analysed in order to argue in favour of a model-based reasoning paradigm in computer science. Preliminarily, it is shown how both deductive and inductive reasoning are insufficient to determine whether a given piece of software is correct with respect to specified behavioural properties. Models algorithmically checked in Model Checking to select executions to be observed in Software Testing are acknowledged as analogical models which establish isomorphic relations with the (...) target system’s data set. Analogical models developed in AST are presented as abductive models providing hypothetical explanations to observed executions. The model assumption—algorithmic check—software testing process is understood as the abduction—deduction—induction process defining the selective abduction and turned to isolate a set of model-based hypotheses concerning the target system behaviours. A manipulative abduction process is finally recognized in the practice of adapting, abstracting and refining models that do not provide successful predictions. (shrink)

BackgroundEuthanasia is performed on occasion, even on newborns, but is highly controversial, and it is prohibited by law and condemned by medical ethics in most countries.AimTo characterise and compare the judgments of lay persons, nurses, and physicians of the acceptability of actively ending the life of a damaged newborn.MethodsConvenience samples of 237 lay persons, 214 nurses, and 76 physicians in the south of France rated the acceptability on a scale of 0–10 of giving a lethal injection in 54 scenarios composed (...) of all combinations of 4 within-subject factors: gestational age of 6,7, or 9 months; 3 levels of severity of either perinatal asphyxia or of genetic disease; attitude of the parents about prolonging care unknown, favourable, or unfavourable; and decision made individually by the physician or collectively by the medical team. Overall ratings were subjected to cluster analysis and each cluster to analysis of variance and graphic representation.ResultsLay persons (mean acceptability rating 4.29) were significantly more favourable to euthanasia than nurses (2.84), p<.005, or physicians (2.12), p<.005. Five clusters were found with different judgment rules, i.e., how the information was integrated. More physicians (30 per cent) than nurses (14 per cent), p<.01, or lay persons (11 percent), p<.01, rated euthanasia as never, under any condition, acceptable. Most, however, asserted that it was increasingly acceptable as the factors combined to favour it, especially when the parents desired to stop treatment. More physicians (45 per cent) and nurses (46 per cent) than lay persons (21 per cent), p<.01, used a complex conjunctive rule (level of parent’s attitude x level of severity of damage x consultation with team or not) rather than a simple additive rule.ConclusionsUnlike lawand medical ethics, most of the lay persons. nurses, and physicians judged the acceptability of euthanasia as a function of the circumstances. Most health professionals combined the factors in a conjunctive (multiplicative), rather than additive, fashion in accordance with legislation for adults in the Netherlands and elsewhere that requires a set of criteria to be fulfilled before it is legitimate to end apatient’s life. (shrink)

The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtained.

The results are presented of first-principles calculations of the structural, elastic and lattice dynamical properties of GdX (X ¼ Bi, Sb). In particular, the lattice parameters, bulk modulus, phonon dispersion curves, elastic constants and their related quantities, such as Young’s modulus, Shear modulus, Zener anisotropy factor, Poisson’s ratio, Kleinman parameter, and longitudinal, transverse and average sound velocities, were calculated and compared with available experimental and other theoretical data. The temperature and pressure variations of the volume, bulk modulus, thermal expansion coefficient, (...) heat capacities, Gru¨neisen parameter and Debye temperatures were predicted in wide pressure (050 GPa) and temperature ranges (0–500 K). The plane-wave pseudopotential approach to the density-functional theory within the GGA approximation implemented in VASP (Vienna ab initio simulation package) was used in all computations. (shrink)

We present a formal theory of contextuality for a set of random variables grouped into different subsets corresponding to different, mutually incompatible conditions. Within each context the random variables are jointly distributed, but across different contexts they are stochastically unrelated. The theory of contextuality is based on the analysis of the extent to which some of these random variables can be viewed as preserving their identity across different contexts when one considers all possible joint distributions imposed on the entire set (...) of the random variables. We illustrate the theory on three systems of traditional interest in quantum physics. These are systems of the Klyachko–Can–Binicioglu–Shumovsky-type, Einstein–Podolsky–Rosen–Bell-type, and Suppes–Zanotti–Leggett–Garg-type. Listed in this order, each of them is formally a special case of the previous one. For each of them we derive necessary and sufficient conditions for contextuality while allowing for experimental errors and contextual biases or signaling. Based on the same principles that underly these derivations we also propose a measure for the degree of contextuality and compute it for the three systems in question. (shrink)

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of (...) the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Rhetoric 34.2 (2001) 93-112 [Access article in PDF] Enthymemes, Common Knowledge, and Plausible Inference Douglas Walton The study of enthymemes has always been regarded as important in logic, critical thinking, and rhetoric, but too often it is the formal or mechanistic aspect of it that has been in the forefront. This investigation will show that there is a kind of plausibilistic script-based reasoning, of a kind that (...) has mainly been studied in artificial intelligence, that should have a much more important role to play in the study of enthymemes. But then curiously, as will also be shown, this plausibilistic type of reasoning was familiar in the ancient world, to the Sophists, as well as to leading philosophers such as Plato and Aristotle. By linking this ancient notion of plausibility to the modern notion used in computer science, this investigation reveals an important basis for the enthymeme that has a type of logical structure in its own right, but also has an informal aspect.An enthymeme, in current usage, is an argument that has one or more premises, or possibly a conclusion, not explicitly stated in the text, but that needs to have these propositions explicitly stated to extract the complete argument from the text. Sometimes enthymemes are described as arguments with "missing premises." That vocabulary is awkward, however, because the nonexplicit statement that needs to be added can be a conclusion, at least in a minority of cases. To make the exposition below smoother, the term nonexplicit assumption will be used to cover either the case of a nonexplicit premise or that of a nonexplicit conclusion. The problem with enthymemes is that if the nonexplicit assumptions in an argument are supposed to be propositions used by the arguer (as opposed to just the propositions needed to make the argument structurally correct, according to some standard), reasonable people can have differences of opinion on what the nonexplicit assumptions are supposed to be. The problem is that filling in the missing parts of enthymemes depends on interpreting the natural language [End Page 93] in which the argument was put forward to try to determine what the speaker meant to say.The solution to the problem comes through the recognition that enthymemes rest not only on formal (structural) criteria, but also on informal criteria. One of the most important of these informal criteria is something often called "common knowledge" (Govier 1992; Freeman 1995). But as shown below in a set of selected case studies of enthymemes, "common knowledge" is not really a kind of knowledge at all. It is really plausibility, or eikos, something well known in the ancient world and often misleadingly translated as "probability." Curiously, Aristotle's original doctrine of the enthymeme was based on this notion of plausibility. This historical fact has often been a source of puzzlement and confusion, and sometimes it has even been taken to indicate a defect or contradiction in Aristotle's treatment of the enthymeme. However, the goal of this investigation is not primarily historical. It is to work out one of the most important required steps toward a solution to the problem of enthymemes. But to do this, it is necessary to come back to the ancient notion of plausible inference. 1. The problem with enthymemes Once you have any formal theory of inference, like syllogistic, for example, you will be confronted by cases of arguments in everyday discourse that meet all the requirements for a structurally correct inference except that some part or parts, usually a premise or a conclusion, is missing. By "missing" is meant that the proposition in question has not been explicitly stated in the text of discourse, even though it may be clear enough that the speaker (writer) was relying on it, or including it, as part of the argument. The classic example is the following inference: All men are mortal; therefore, Socrates is mortal. To evaluate such an argument, surely some account of the "hidden" or "missing" assumption needs to be taken. The problem with enthymemes (Burke 1985; Gough and Tindale 1985; Hitchcock 1985) is that, if given carte... (shrink)

A universal Horn sentence in the language of polynomial-time computable combinatorial functions of natural numbers is true for the natural numbers if, and only if, it is true for PETs of p-time p-isolated sets with functions induced by fully p-time combinatorial operators.

Based on an ethnographic project in a public high school in a low-income neighborhood in South Los Angeles, this paper argues that access to information and communication technologies cannot be taken as helpful or empowering on its own terms; instead, concerns about justice must be accounted for by the local communities technology is meant to benefit. This paper juxtaposes the concept of technological access with recent work in feminist science and technology studies on infrastructure, maintenance, and ethics. In contrast to (...) popular descriptions of ICTs as emancipatory and transformative, in the setting of an urban school, access produced extensive demands for attention, time, and information. This paper focuses on the labor of a group of student workers, Student Technology Leaders, and how they became responsible for the significant amount of repair and maintenance work involved in keeping hundreds of new computing devices available for use. An expanded process of accounting can more realistically frame issues of justice and its relationship to ICTs. I use a town hall meeting held with these students as an example of a processual vision of justice, one that encourages the beneficiaries of technological access to evaluate costs, benefits, and ethical concerns together. (shrink)

This book provides an argumentation model for means-end reasoning, a distinctive type of reasoning used for problem-solving gand decision-making. Means-end reasoning is modeled as goal-directed argumentation from an agent's goals and known circumstances, and from an action selected as a means, to a decision to carry out the action. Goal-based reasoning for argumentation provides an argumentation model for this kind of reasoning, showing how it is employed in settings of intelligent deliberation where agents try to collectively arrive at a conclusion (...) on what they should do to move forward in a set of circumstances. The book explains how this argumentation model can help build more realistic computational systems of deliberation and decision-making and shows how such systems can be applied to solve problems posed by goal-based reasoning in numerous fields, from social psychology and sociology, to law, political science, anthropology, cognitive science, artificial intelligence, multi-agent systems, and robotics." -- Back cover. (shrink)

The academic journey to a widely acknowledged Machine Consciousness is anticipated to be an emotional one. Both in terms of the active debate provoked by the subject and a hypothesized need to encapsulate an analogue of emotions in an artificial system in order to progress towards machine consciousness. This paper considers the inspiration that the concepts related to emotion may contribute to cognitive systems when approaching conscious-like behavior. Specifically, emotions can set goals including balancing explore versus exploit, facilitate action in (...) unknown domains and modify existing behaviors, which are explored in cognitive robotics experiments. (shrink)

Research in person and face perception has broadly focused on group-level consensus that individuals hold when making judgments of others. However, a growing body of research demonstrates that individual variation is larger than shared, stimulus-level variation for many social trait judgments. Despite this insight, little research to date has focused on building and explaining individual models of face perception. Studies and methodologies that have examined individual models are limited in what visualizations they can reliably produce to either noisy and blurry (...) or computer avatar representations. Methods that produce low-fidelity visual representations inhibit generalizability by being clearly computer manipulated and produced. In the present work, we introduce a novel paradigm to visualize individual models of face judgments by leveraging state-of-the-art computer vision methods. Our proposed method can produce a set of photorealistic face images that correspond to an individual's mental representation of a specific attribute across a variety of attribute intensities. We provide a proof-of-concept study which examines perceived trustworthiness/untrustworthiness and masculinity/femininity. We close with a discussion of future work to substantiate our proposed method. (shrink)

In an era of unrivalled sequencing, computation and networking capability, international sharing of genomic samples and data is becoming a modus operandi for modern medical research. Researchers are collaborating to establish large collections with global scale. Having never before set foot outside the cell, the molecules that shape us are being digitized and launched across the globe. Protecting individual privacy interests in this information is a central challenge of the genomic research era. This article reviews international privacy norms governing human (...) genomic biobanks and databases. It will not directly consider biobanks established for other health-related purposes, such as screening or therapy. A genomic biobank is “a hybrid infrastructure,” an organized collection of human biological material combined with associated health information: physical measurements, outcome data in medical records, and epidemiological information, as well as genomic data derived from the samples. (shrink)

Psychologists and neuroscientists extensively rely on computational models for studying and analyzing the human mind. Traditionally, such computational models have been hand-designed by expert researchers. Two prominent examples are cognitive architectures and Bayesian models of cognition. While the former requires the specification of a fixed set of computational structures and a definition of how these structures interact with each other, the latter necessitates the commitment to a particular prior and a likelihood function which – in combination with Bayes’ rule – (...) determine the model's behavior. In recent years, a new framework has established itself as a promising tool for building models of human cognition: the framework of meta-learning. In contrast to the previously mentioned model classes, meta-learned models acquire their inductive biases from experience, i.e., by repeatedly interacting with an environment. However, a coherent research program around meta-learned models of cognition is still missing to this day. The purpose of this article is to synthesize previous work in this field and establish such a research program. We accomplish this by pointing out that meta-learning can be used to construct Bayes-optimal learning algorithms, allowing us to draw strong connections to the rational analysis of cognition. We then discuss several advantages of the meta-learning framework over traditional methods and reexamine prior work in the context of these new insights. (shrink)

In 1988, Smolensky proposed that connectionist processing systems should be understood as operating at what he termed the `subsymbolic' level. Subsymbolic systems should be understood by comparing them to symbolic systems, in Smolensky's view. Up until recently, there have been real problems with analyzing and interpreting the operation of connectionist systems which have undergone training. However, recently published work on a network trained on a set of logic problems originally studied by Bechtel and Abrahamsen (1991) seems to offer the potential (...) to provide a detailed, empirically based answer to questions about the nature of subsymbols. In this paper, a network analysis procedure and the results obtained using it are discussed. This provides the basis for an insight into the nature of subsymbols, which is surprising. (shrink)

This paper is devoted to computer modelling of the development and regeneration of multicellular biological structures. Some species are able to regenerate parts of their body after amputation damage, but the global rules governing cooperative cell behaviour during morphogenesis are not known. Here, we consider a simplified model organism, which consists of tissues formed around special cells that can be interpreted as stem cells. We assume that stem cells communicate with each other by a set of signals, and that the (...) values of these signals depend on the distance between cells. Thus the signal distribution characterizes location of stem cells. If the signal distribution is changed, then the difference between the initial and the current signal distribution affects the behaviour of stem cells—e.g. as a result of an amputation of a part of tissue the signal distribution changes which stimulates stem cells to migrate to new locations, appropriate for regeneration of the proper pattern. Moreover, as stem cells divide and form tissues around them, they control the form and the size of regenerating tissues. This two-level organization of the model organism, with global regulation of stem cells and local regulation of tissues, allows its reproducible development and regeneration. (shrink)

Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.

We contrast person-centered categories with objective categories related to physics: consciousness vs. mechanism, observer vs. observed, agency vs. event causation. semantics vs. syntax, beliefs and desires vs. dispositions. How are these two sets of categories related? This talk will discuss just one such dichotomy: consciousness vs. mechanism. Two extreme views are dualism and reductionism. An intermediate view is emergence. Here, consciousness is part of the natural order (as against dualism), but consciousness is not definable only in terms of physical mass, (...) length, and time (as against reductionism). There are several detailed theories of emergence. One is based on the Great Chain of Being and on organic evolutionary hierarchy. The theory here is based instead on the concept of relational holism in quantum mechanics. The resulting brain model has two interacting systems: a computational system and a quantum system (a Bose-Einstein condensate), perhaps interacting via EEG waves. Thus, we need both person-centered and matter-centered categories to describe human beings. Some possible experimental tests are discussed. (shrink)

This paper looks at citizen‐facing e‐government. It considers how the non‐discretionary nature of the citizen’s relationship with government makes citizen‐facing e‐government different from business‐consumer e‐commerce. Combined with the moral basis of the state, the paper argues that there is an obligation for the state to set an example, which should affect the design of citizen‐facing e‐government, with design‐for‐all being an appropriate philosophy. Other consequences should include a preference for open standards and a wariness of unintentional endorsement of commercial products. E‐government (...) should also offer a good level of data protection and security, and has a role in educating citizens in matters of computer security. Advantages and disadvantages that may come from e‐government adoption are considered, including a number of ways in which cost savings and increases in convenience may be achieved. There are brief discussions of questions of distribution of the benefits of e‐government adoption and of the relationship of e‐government to e‐democracy. (shrink)

These lecture notes were composed while teaching a class at Stanford and studying the work of Brian Chellas (Modal Logic: An Introduction, Cambridge: Cambridge University Press, 1980), Robert Goldblatt (Logics of Time and Computation, Stanford: CSLI, 1987), George Hughes and Max Cresswell (An Introduction to Modal Logic, London: Methuen, 1968; A Companion to Modal Logic, London: Methuen, 1984), and E. J. Lemmon (An Introduction to Modal Logic, Oxford: Blackwell, 1977). The Chellas text influenced me the most, though the order of (...) presentation is inspired more by Goldblatt.2 My goal was to write a text for dedicated undergraduates with no previous experience in modal logic. The text had to meet the following desiderata: (1) the level of difficulty should depend on how much the student tries to prove on his or her own—it should be an easy text for those who look up all the proofs in the appendix, yet more difficult for those who try to prove everything themselves; (2) philosophers (i.e., colleagues) with a basic training in logic should be able to work through the text on their own; (3) graduate students should find it useful in preparing for a graduate course in modal logic; (4) the text should prepare people for reading advanced texts in modal logic, such as Goldblatt, Chellas, Hughes and Cresswell, and van Benthem, and in particular, it should help the student to see what motivated the choices in these texts; (5) it should link the two conceptions of logic, namely, the conception of a logic as an axiom system (in which the set of theorems is constructed from the bottom up through proof sequences) and the conception of a logic as a set containing initial ‘axioms’ and closed under ‘rules of inference’ (in which the set of theorems is constructed from the top down, by carving out the logic from the set of all formulas as the smallest set closed under the rules); finally, (6) the pace for the presentation of the completeness theorems should be moderate—the text should be intermediate between Goldblatt and Chellas in this regard (in Goldblatt, the completeness proofs come too quickly for the undergraduate, whereas in Chellas, too many unrelated.... (shrink)

The present article is an attempt to set forth and examine the conclusions of what is perhaps Husserl’s finest piece of philosophical investigation, and one of the finest pieces in the whole history of philosophy: the investigation of the consciousness of time, with its extraordinary combination of an unchanging form with an absolute flux of which it is none other than the very form itself. This investigation puts Husserl on a level with the wisest heads on the matter, with Aristotle (...) in Books IV and VI of the Physics, with Augustine in Book X of the Confessions, and with Kant, whose whole Critique of Pure Reason may be said to be an examination of what is necessary to temporal experience. In Husserl’s work we have, we may say, the greatest of recent philosophers tackling the greatest of philosophical problems, one in which contradiction is always appearing in novel forms, to be evaded only by the naïve superficiality of a Minkowski or a Grünbaum, or by such infinitely useful subtlety as Husserl himself practises. As Husserl himself put it near the beginning of his 1905 Lectures. (shrink)

The DAMA project is an observatory for rare processes and it is operative deep underground at the Gran Sasso National Laboratory of the I.N.F.N. In particular, the DAMA/LIBRA (Large sodium Iodide Bulk for RAre processes) set-up consists of highly radiopure NaI(Tl) detectors for a total sensitive exposed mass of ≃250 kg. Recent results, obtained by this set-up by exploiting the model independent annual modulation signature of Dark Matter (DM) particles, have confirmed and improved those obtained by the former DAMA/NaI experiment. (...) A model independent evidence for the presence of Dark Matter particles in the galactic halo is cumulatively obtained at 8.2 σ C.L. No systematics or side reactions able to account for the measured modulation amplitude and to contemporaneously satisfy all the many specific requirements of the signature have been found or suggested by anyone over more than a decade. An example of one of the many possible model dependent corollary quests for the candidate particles and for the related astrophysical, nuclear and particle physics scenarios is presented considering the whole cumulative exposure. Future perspectives are shortly addressed. (shrink)

We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of E. Fokina, I. Kalimullin, and R. Miller to show that for every computable ordinal $\alpha$, $\mathbf{0}^{}$ is the degree of categoricity of some computable structure $\mathcal{A}$. We show additionally that for $\alpha$ a computable successor ordinal, every degree $2$-c.e. in and above $\mathbf{0}^{}$ is a degree of categoricity. We further prove that every degree of categoricity is hyperarithmetic and show that the index set of (...) structures with degrees of categoricity is $\Pi_{1}^{1}$-complete. (shrink)

A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null ${\Sigma^0_1}$ (recursive) class of reals. Although these randomness notions are very closely related, the set of Turing degrees containing reals that are K-trivial has very different properties from the set of Turing degrees that are Schnorr trivial. Nies proved in (Adv Math 197(1):274–305, 2005) that all K-trivial reals are low. In this paper, we prove that if ${{\bf h'} \geq_T {\bf 0''}}$ , then h (...) contains a Schnorr trivial real. Since this concept appears to separate computational complexity from computational strength, it suggests that Schnorr trivial reals should be considered in a structure other than the Turing degrees. (shrink)

For 50 years, Star Trek has been an inspiration to its fans around the world, helping them to dream of a better future. This inspiration has entered our culture and helped to shape much of the technology of the early 21st Century. The contributors to this volume are researchers and teachers in a wide variety of disciplines; from Astrophysics to Ethnology, from English and History to Medicine and Video Games, and from American Studies to the study of Collective Computing Systems. (...) What the authors have in common is that some version of Star Trek has inspired them, not only in their dreams of what may be, but in the ways in which they work - and teach others to work - here in the real world. Introduced with references to Star Trek films and television shows, and illustrated with original cartoons, each of the 15 chapters included in this volume provides insights into research and teaching in this range of academic fields. (shrink)

We study for each computably bounded $\Pi ^0_1$ class P the set of degrees of c.e. paths in P. We show, amongst other results, that for every c.e. degree a there is a perfect $\Pi ^0_1$ class where all c.e. members have degree a. We also show that every $\Pi ^0_1$ set of c.e. indices is realized in some perfect $\Pi ^0_1$ class, and classify the sets of c.e. degrees which can be realized in some $\Pi ^0_1$ class as exactly (...) those with a computable representation. (shrink)

A general algorithm is given for determining whether or not a given set of pair distributions allows for the construction of all the members of a specified set of higher-order distributions which return the given pair distributions as marginals. This mathematical question underlies studies of quantum correlation experiments such as those of Bell or of Clauser and Horne, or their higher-spin generalizations. The algorithm permits the analysis of rather intricate versions of such problems, in a form readily adaptable to the (...) computer. The general procedure is illustrated by simple derivations of the results of Mermin and Schwarz for the symmetric spin-1 and spin-3/2 Einstein-Podolsky-Rosen problems. It is also used to extend those results to the spin-2 and spin-5/2 cases, providing further evidence that the range of strange quantum theoretic correlations does not diminish with increasing s. The algorithm is also illustrated by giving an alternative derivation of some recent results on the necessity and sufficiency of the Clauser-Horne conditions. The mathematical formulation of the algorithm is given in general terms without specific reference to the quantum theoretic applications. (shrink)

Two experiments investigated inferences based on suppositions. In Experiment 1, the subjects decided whether suppositions about individuals' veracity were consistent with their assertions—for example, whether the supposition “Ann is telling the truth and Beth is telling a lie”, is consistent with the premises: “Ann asserts: I am telling the truth and Beth is telling the truth. Beth asserts: Ann is telling the truth”. It showed that these inferences are more difficult than ones based on factual premises: “Ann asserts: I live (...) in Dublin and Beth lives in Dublin”. There was no difference between problems about truthtellers and liars, who always told the truth or always lied, and normals, who sometimes told the truth and sometimes lied. In Experiment 2, the subjects made inferences about factual matters set in three contexts: a truth-inducing context in which friends confided their personality characteristics, a lie-inducing context in which business rivals advertised their products, and a neutral context in which computers printed their program characteristics. Given the supposition that the individuals were lying, it was more difficult to make inferences in a truth-inducing context than in the other two contexts. We discuss the implications of our results for everyday reasoning from suppositions, and for theories of reasoning based on models or inference rules. (shrink)

The INBIOSA project brings together a group of experts across many disciplines who believe that science requires a revolutionary transformative step in order to address many of the vexing challenges presented by the world. It is INBIOSA’s purpose to enable the focused collaboration of an interdisciplinary community of original thinkers. This paper sets out the case for support for this effort. The focus of the transformative research program proposal is biology-centric. We admit that biology to date has been more fact-oriented (...) and less theoretical than physics. However, the key leverageable idea is that careful extension of the science of living systems can be more effectively applied to some of our most vexing modern problems than the prevailing scheme, derived from abstractions in physics. While these have some universal application and demonstrate computational advantages, they are not theoretically mandated for the living. A new set of mathematical abstractions derived from biology can now be similarly extended. This is made possible by leveraging new formal tools to understand abstraction and enable computability. [The latter has a much expanded meaning in our context from the one known and used in computer science and biology today, that is "by rote algorithmic means", since it is not known if a living system is computable in this sense (Mossio et al., 2009).] Two major challenges constitute the effort. The first challenge is to design an original general system of abstractions within the biological domain. The initial issue is descriptive leading to the explanatory. There has not yet been a serious formal examination of the abstractions of the biological domain. What is used today is an amalgam; much is inherited from physics (via the bridging abstractions of chemistry) and there are many new abstractions from advances in mathematics (incentivized by the need for more capable computational analyses). Interspersed are abstractions, concepts and underlying assumptions “native” to biology and distinct from the mechanical language of physics and computation as we know them. A pressing agenda should be to single out the most concrete and at the same time the most fundamental process-units in biology and to recruit them into the descriptive domain. Therefore, the first challenge is to build a coherent formal system of abstractions and operations that is truly native to living systems. Nothing will be thrown away, but many common methods will be philosophically recast, just as in physics relativity subsumed and reinterpreted Newtonian mechanics. -/- This step is required because we need a comprehensible, formal system to apply in many domains. Emphasis should be placed on the distinction between multi-perspective analysis and synthesis and on what could be the basic terms or tools needed. The second challenge is relatively simple: the actual application of this set of biology-centric ways and means to cross-disciplinary problems. In its early stages, this will seem to be a “new science”. This White Paper sets out the case of continuing support of Information and Communication Technology (ICT) for transformative research in biology and information processing centered on paradigm changes in the epistemological, ontological, mathematical and computational bases of the science of living systems. Today, curiously, living systems cannot be said to be anything more than dissipative structures organized internally by genetic information. There is not anything substantially different from abiotic systems other than the empirical nature of their robustness. We believe that there are other new and unique properties and patterns comprehensible at this bio-logical level. The report lays out a fundamental set of approaches to articulate these properties and patterns, and is composed as follows. -/- Sections 1 through 4 (preamble, introduction, motivation and major biomathematical problems) are incipient. Section 5 describes the issues affecting Integral Biomathics and Section 6 -- the aspects of the Grand Challenge we face with this project. Section 7 contemplates the effort to formalize a General Theory of Living Systems (GTLS) from what we have today. The goal is to have a formal system, equivalent to that which exists in the physics community. Here we define how to perceive the role of time in biology. Section 8 describes the initial efforts to apply this general theory of living systems in many domains, with special emphasis on crossdisciplinary problems and multiple domains spanning both “hard” and “soft” sciences. The expected result is a coherent collection of integrated mathematical techniques. Section 9 discusses the first two test cases, project proposals, of our approach. They are designed to demonstrate the ability of our approach to address “wicked problems” which span across physics, chemistry, biology, societies and societal dynamics. The solutions require integrated measurable results at multiple levels known as “grand challenges” to existing methods. Finally, Section 10 adheres to an appeal for action, advocating the necessity for further long-term support of the INBIOSA program. -/- The report is concluded with preliminary non-exclusive list of challenging research themes to address, as well as required administrative actions. The efforts described in the ten sections of this White Paper will proceed concurrently. Collectively, they describe a program that can be managed and measured as it progresses. (shrink)

Emotions are a natural vector for acting together with others and are witnessed in human behaviour, perception and body functions. For this reason, studies of human-to-human interaction, such as multi-person motor synchronisation, are a perfect setting to disentangle the linkage of emotion with socio-motor interaction. And yet, the majority of joint action studies aiming at understanding the impact of emotions on multi-person performance resort to enacted emotions, the ones that are emulated based on the previous experience of such emotions, and (...) almost exclusively focus on dyadic interaction. In addition, tasks chosen to study emotion in joint action are frequently characterised by a reduced number of physical dimensions to gain experimental control and subsequent facilitation in data analysis. Therefore, it is not clear how naturalistically induced emotions diffuse in more ecological interactions with other people and how emotions affect the process of interpersonal synchronisation. Here, we show that positive and negative emotions differently alter spontaneous human synchronous behaviour during a multi-person improvisation task. The study involved 39 participants organised in triads who self-reported liking improvisational activities. The task involved producing improvisational movements with the right hand. Participants were emotionally induced by manipulated social feedback involving a personal ranking score. Three-dimensional spatio-temporal data and cardiac activity were extracted and transformed into oscillatory signals to compute behavioural and physiological synchrony. Our results demonstrate that individuals induced with positive emotions, as opposed to negative emotions or a neutral state, maintained behavioural synchrony with other group members for a longer period of time. These findings contribute to the emerging shift of neuroscience of emotion and affective sciences towards the environment of social significance where emotions appear the most—in interaction with others. Our study showcases a method of quantification of synchrony in an improvisational and interactive task based on a well-established Kuramoto model. (shrink)

We present a proof for a conjecture previously formulated by Dzhafarov et al.. The conjecture specifies a measure for the degree of contextuality and a criterion for contextuality in a broad class of quantum systems. This class includes Leggett–Garg, EPR/Bell, and Klyachko–Can–Binicioglu–Shumovsky type systems as special cases. In a system of this class certain physical properties \ are measured in pairs \ \); every property enters in precisely two such pairs; and each measurement outcome is a binary random variable. Denoting (...) the measurement outcomes for a property \ in the two pairs it enters by \ and \, the pair of measurement outcomes for \ \) is \ \). Contextuality is defined as follows: one computes the minimal possible value \ for the sum of \ ) that is allowed by the individual distributions of \ and \; one computes the minimal possible value \ for the sum of \ across all possible couplings of the entire set of random variables \ in the system; and the system is considered contextual if \ ). This definition has its justification in the general approach dubbed Contextuality-by-Default, and it allows for measurement errors and signaling among the measured properties. The conjecture proved in this paper specifies the value of \ in terms of the distributions of the measurement outcomes \ \). (shrink)

Data hiding and watermarking are considered one of the most important topics in cyber security. This article proposes an optimized method for embedding a watermark image in a cover medium (color image). First, the color of the image is separated into three components (RGB). Consequently, the discrete wavelet transform is applied to each component to obtain four bands (high–high, high–low, low–high, and low–low), resulting in 12 bands in total. By omitting the low–low band from each component, a new square matrix (...) is formed from the rest bands to be used for the hiding process after adding keys to it. These keys are generated using a hybrid approach, combining two chaotic functions, namely Gaussian and exponential maps. The embedding matrix is divided into square blocks with a specific length, each of which is converted using Hessenberg transform into two matrices, P and H. For each block, a certain location within the H-matrix is used for embedding a secret value; the updated blocks are assembled, and the reverse process is performed. An optimization method is applied, through the application of the firework algorithm, on the set of the initial values that generate keys. Using an optimization procedure to obtain keys requires performing lowest possible change rate in an image and maintain the quality of the image. To analyze and test the efficiency of the proposed method, mean-square error (MSE) and peak signal-to-noise ratio (PSNR) measurements are calculated. Furthermore, the robustness of the watermark is computed by applying several attacks. The experimental results show that the value of the MSE is reduced by about 0.01 while the value of the PSNR is increased by about 1.25 on average. Moreover, the proposed method achieved a high-retrieval rate in comparison with the non-optimization approach. (shrink)

Exploring how people represent natural categories is a key step toward developing a better understanding of how people learn, form memories, and make decisions. Much research on categorization has focused on artificial categories that are created in the laboratory, since studying natural categories defined on high-dimensional stimuli such as images is methodologically challenging. Recent work has produced methods for identifying these representations from observed behavior, such as reverse correlation (RC). We compare RC against an alternative method for inferring the structure (...) of natural categories called Markov chain Monte Carlo with People (MCMCP). Based on an algorithm used in computer science and statistics, MCMCP provides a way to sample from the set of stimuli associated with a natural category. We apply MCMCP and RC to the problem of recovering natural categories that correspond to two kinds of facial affect (happy and sad) from realistic images of faces. Our results show that MCMCP requires fewer trials to obtain a higher quality estimate of people’s mental representations of these two categories. (shrink)

‘Neuroeconomics’ can be broadly defined as the research of how the brain interacts with the environment to make decisions that are functional given individual and contextual constraints. Deciphering such brain-environment transactions requires mechanistic understandings of the neurobiological processes that implement value-dependent decision making. To this end, a common empirical approach is to investigate neural mechanisms of reward-based decision making. Flexible updating of choices and associated expected outcomes in ways that are adaptive for a given task (or a given set of (...) tasks) at hand relies on dynamic neurochemical tuning of the brain’s functional circuitries involved in the representation of tasks, goals and reward prediction. Empirical evidence as well as computational theories indicate that various neurotransmitter systems (e.g., dopamine, norepinephrine, and serotonin) play important roles in reward-based decision making. In light of the apparent aging-related decline in various aspects of the dopaminergic system as well as the effects of neuromodulation on reward-related processes, this article focuses selectively on the literature that highlights the triadic relations between dopaminergic modulation, reward-based decision making, and aging. Directions for future research on aging and neuroeconomoics are discussed. (shrink)

Ontology engineering is mainly done by domain experts who are specialists in their domain but have, if at all, limited knowledge in logics, computer science, or analytic philosophy. The literature on formal ontologies and biomedical ontologies is neither suited nor intended to serve as an educational resource that would help domain experts to become good ontologists. Existing educational resources focus rather on ontology tools and languages than on good practice. The purpose of the GoodOD guideline is to pave the road (...) for domain experts who want (or need) to become ontology engineers. It pursues the openly pragmatic approach that ontology engineers only need to know ontology theory to the extent which supports the (measurable) outcome of their work. The GoodOD Guideline builds upon given philosophical and methodological principles as well as preexisting tools and resources. In particular (pragmatic) scientific realism, first order logics and its subset OWL-DL (description logics), set theory, an upper-level ontology with high-level categories and a canonic set of relations, constraints which limit the freedom of choice when building coordinate expressions, the ontology editor Protégé 4, a complete DL reasoner, such as HermIT, ontology design patterns, and naming conventions. -/- Given these precepts the guideline contains all the knowledge to be acquired by a user to be able to solve ontology engineering problems in a foreseeable and non-arbitrary way. The didactic concept is to convey the skills not only by theory but also by practical examples. (shrink)

The structure of traditional fiction is essentially linear or serial. No matter how complex a given work may be, it presents information to its reader successively, one element at a time, in a sequence determined by its author. By contrast, interactive fiction is parallel in structure or, more accurately, dendritic or tree-shaped. Not one, but several possible courses of action are open to the reader. Further, which one actually happens depends largely, though not exclusively, upon the reader’s own choices. To (...) be sure, the author is still in overall control, since it is she who has set up the particular nexus of events, but the route up the narrative tree, the actual sequence of events, is generally affected, if not completely determined, by the reader’s responses to that particular reader’s specific situation. In an adventure, the sequence of action frequently depends upon the reader’s decision to go in one geographical direction rather than another. In the eliza sample, the content of the “story” depends on such particulars as whether this reader has a brother or not, whether she fears her father, and why she has consulted the terminal. In general, the text presented to the eliza-reader depends on what that reader has already said and how the computer has interpreted and stored it, and this is generally true of interactive fiction.Further, interactive fiction is, in principle , open-ended—infinite. A conversation with eliza could go on for as long as one with Woody Allen’s psychoanalyst—in principle, forever. It has no necessary terminus. The program will go one writing texts and answers on the screen as long as the reader or player chooses to supply responses. Further, the computer can act as a metafictional narrator like John Barth or Thomas Pynchon who can create a story within a story or a story that generates another story within itself which generates another story within itself and so on, fictions dizzying and dazzling. One senses one’s essential humanity wobbling in the midst of the infinite paradoxes of existence and meaning. Anthony J. Niesz, assistant professor of German at Yale University, is the author of Dramaturgy in German Drama: From Gryphius to Goethe . He is interested in the phenomenon of the meta-theater, especially in seventeenth- and eighteenth-century German drama, as well as in the literature and cultural policies of the German Democratic Republic. Norman N. Holland is Milbauer Eminent Scholar at the University of Florida. He is the author of Laughing and The I. (shrink)

We explore the complexity of Sacks’ Splitting Theorem in terms of the mind change functions associated with the members of the splits. We prove that, for any c.e. set A, there are low computably enumerable sets $A_0\sqcup A_1=A$ splitting A with $A_0$ and $A_1$ both totally $\omega ^2$ -c.a. in terms of the Downey–Greenberg hierarchy, and this result cannot be improved to totally $\omega $ -c.a. as shown in [9]. We also show that if cone avoidance is added then there (...) is no level below $\varepsilon _0$ which can be used to characterize the complexity of $A_1$ and $A_2$. (shrink)

Despite the importance of knowing the cognitive capabilities of children with neurodevelopmental conditions, less than one-third of children with cerebral palsy participate in standardized assessments. Globally, approximately 50% of people with cerebral palsy have an intellectual disability and there is significant risk for domain-specific cognitive impairments for the majority of people with cerebral palsy. However, standardized cognitive assessment tools are not accessible to many children with cerebral palsy, as they require manual manipulation of objects, verbal response and/or speeded response. As (...) such, standardised assessment may result in an underestimation of abilities for children with significant motor and/or speech impairment. The overall aim of the project is to examine and compare the psychometric properties of standardised cognitive assessment tools that have been accommodated for use with either a switch device or eye-gaze control technologies, with the specific aims to: Examine the psychometric properties of accommodated assessment tools by comparing the performance of typically developing children on six cognitive assessment tools administered via standardised versus accommodated administration; Describe and compare the performance and user experience of children with cerebral palsy on six accommodated cognitive assessments administered via switch or eye-gaze control technologies. Secondary aims are to: Describe the completion rates and time to complete assessments of participants in each group; Within the group with cerebral palsy, examine the effects of condition-specific characteristics and demographics on participation. This protocol paper describes a two-phase validation and acceptability study that utilizes a mixed-model design. This study will collect concurrent data from 80 typically developing children and 40 children with cerebral palsy, who use switch or eye-gaze control technology as alternate access communication methods. The set of instruments will measure receptive vocabulary, fluid reasoning, sustained attention, vision perception, visuospatial working memory and executive functions. Data analyses will be conducted using SPSS v. 25 and R v 4.1.0. SPSS Sample Power 3 was used for power computation and allows for a 10% drop out rate. Quantitative descriptive statistics, measurement agreement data plotting, bivariate and multiple regressions analysis will be conducted using appropriate methods. (shrink)

Volume 19, Issue 6, June 2019, Page 76-78.

We exploit properties of certain directed graphs, obtained from the families of sets with special effective enumeration properties, to generalize several results in computable model theory to higher levels of the hyperarithmetical hierarchy. Families of sets with such enumeration features were previously built by Selivanov, Goncharov, and Wehner. For a computable successor ordinal α, we transform a countable directed graph into a structure such that has a isomorphic copy if and only if has a computable isomorphic copy.A (...) computable structure is categorical if for all computable isomorphic copies of , there is an isomorphism from onto , which is . We prove that for every computable successor ordinal α, there is a computable, categorical structure, which is not relatively categorical. This generalizes the result of Goncharov that there is a computable, computably categorical structure, which is not relatively computably categorical.An additional relation R on the domain of a computable structure is intrinsically on if in all computable isomorphic copies of , the image of R is . We prove that for every computable successor ordinal α, there is an intrinsically relation on a computable structure, which not relatively intrinsically . This generalizes the result of Manasse that there is an intrinsically computably enumerable relation on a computable structure, which is not relatively intrinsically computably enumerable.The dimension of a structure is the number of computable isomorphic copies, up to isomorphisms. We prove that for every computable successor ordinal α and every n≥1, there is a computable structure with dimension n. This generalizes the result of Goncharov that there is a structure of computable dimension n for every n≥1.Finally, we prove that for every computable successor ordinal α, there is a countable structure with isomorphic copies in just the Turing degrees of sets X such that relative to X is not . In particular, for every finite n, there is a structure with isomorphic copies in exactly the non- Turing degrees. This generalizes the result obtained by Wehner, and independently by Slaman, that there is a structure with isomorphic copies in exactly the nonzero Turing degrees. (shrink)

We study the sets that are computable from both halves of some (Martin–Löf) random sequence, which we call 1/2-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the K-trivial sets. We characterize 1/2-bases as the sets computable from both halves of Chaitin’s Ω, and as the sets that obey the cost function c(x,s)=Ωs−Ωx−−−−−−−√. Generalizing these results yields a dense (...) hierarchy of subideals in the K-trivial degrees: For k<n, let Bk/n be the collection of sets that are below any k out of n columns of some random sequence. As before, this is an ideal generated by its c.e. elements and the random sequence in the definition can always be taken to be Ω. Furthermore, the corresponding cost function characterization reveals that Bk/n is independent of the particular representation of the rational k/n, and that Bp is properly contained in Bq for rational numbers p<q. These results are proved using a generalization of the Loomis–Whitney inequality, which bounds the measure of an open set in terms of the measures of its projections. The generality allows us to analyze arbitrary families of orthogonal projections. As it turns out, these do not give us new subideals of the K-trivial sets; we can calculate from the family which Bp it characterizes. We finish by studying the union of Bp for p<1; we prove that this ideal consists of the sets that are robustly computable from some random sequence. This class was previously studied by Hirschfeldt [D. R. Hirschfeldt, C. G. Jockusch, R. Kuyper and P. E. Schupp, Coarse reducibility and algorithmic randomness, J. Symbolic Logic81(3) (2016) 1028–1046], who showed that it is a proper subclass of the K-trivial sets. We prove that all such sets are robustly computable from Ω, and that they form a proper subideal of the sets computable from every (weakly) LR-hard random sequence. We also show that the ideal cannot be characterized by a cost function, giving the first such example of a Σ03 subideal of the K-trivial sets. (shrink)