LOGICAL AND PSYCHOLOGICAL PARTITIONING OF MIND: DEPICTING THE SAME MAP?

The aim of this paper is to demonstrate that empirically delimited structures of mind are also differentiable by means of systematic logical analysis. In the sake of this aim, the paper first summarizes Demetriou's theory of cognitive organization and growth. This theory assumes that the mind is a multistructural entity that develops across three fronts: the processing system that constrains processing potentials, a set of specialized structural systems (SSSs) that guide processing within different reality and knowledge domains, and a hypecognitive system that monitors and controls the functioning of all other systems. In the second part the paper focuses on the SSSs, which are the target of our logical analysis, and it summarizes a series of empirical studies demonstrating their autonomous operation. The third part develops the logical proof showing that each SSS involves a kernel element that cannot be reduced to standard logic or to any other SSS. The implications of this analysis for the general theory of knowledge and cognitive development are discussed in the concluding part of the paper

A Multimedia Interactive Environment Using Program Archetypes: Divide-and-Conquer

As networks and distributed systems that can exploit parallel computing become more widespread, the need for ways to teach parallel programming effectively grows as well. Even though many colleges and universities provide courses on parallel programming [1], most of those courses are reserved for graduate students and advanced undergraduates. There is a demand for ways to teach fundamental parallel programming concepts to people with just a working knowledge of programming. By using the idea of a software archetype, and providing a learning environment that teaches both concept and coding, we hope to satisfy this need. This paper presents an overview of the multimedia approach we took in teaching parallel programming and offers Divide-and-Conquer as an example of its use

The use of data-mining for the automatic formation of tactics

This paper discusses the usse of data-mining for the automatic formation of tactics. It was presented at the Workshop on Computer-Supported Mathematical Theory Development held at IJCAR in 2004. The aim of this project is to evaluate the applicability of data-mining techniques to the automatic formation of tactics from large corpuses of proofs. We data-mine information from large proof corpuses to find commonly occurring patterns. These patterns are then evolved into tactics using genetic programming techniques

Robust Computer Algebra, Theorem Proving, and Oracle AI

In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and AI control problems, is a superintelligent AI system that only answers questions. The aim of this manuscript is to survey contemporary research problems related to oracles which align with long-term research goals of AI safety. We examine existing question answering systems and argue that their high degree of architectural heterogeneity makes them poor candidates for rigorous analysis as oracles. On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem provers, systems which have largely been developed independent of one another, provide a concrete set of problems related to the notion of provable safety that has emerged in the AI safety community. We review approaches to interfacing CASs with theorem provers, describe well-defined architectural deficiencies that have been identified with CASs, and suggest possible lines of research and practical software projects for scientists interested in AI safety.Comment: 15 pages, 3 figure

Coupled Reversible and Irreversible Bistable Switches Underlying TGF-\beta-induced Epithelial to Mesenchymal Transition

Epithelial to mesenchymal transition (EMT) plays important roles in embryonic development, tissue regeneration and cancer metastasis. While several feedback loops have been shown to regulate EMT, it remains elusive how they coordinately modulate EMT response to TGF-\beta treatment. We construct a mathematical model for the core regulatory network controlling TGF-\beta-induced EMT. Through deterministic analyses and stochastic simulations, we show that EMT is a sequential two-step program that an epithelial cell first transits to partial EMT then to the mesenchymal state, depending on the strength and duration of TGF-\beta stimulation. Mechanistically the system is governed by coupled reversible and irreversible bistable switches. The SNAIL1/miR-34 double negative feedback loop is responsible for the reversible switch and regulates the initiation of EMT, while the ZEB/miR-200 feedback loop is accountable for the irreversible switch and controls the establishment of the mesenchymal state. Furthermore, an autocrine TGF-\beta/miR-200 feedback loop makes the second switch irreversible, modulating the maintenance of EMT. Such coupled bistable switches are robust to parameter variation and molecular noise. We provide a mechanistic explanation on multiple experimental observations. The model makes several explicit predictions on hysteretic dynamic behaviors, system response to pulsed stimulation and various perturbations, which can be straightforwardly tested.Comment: 32 pages, 8 figures, accepted by Biophysical Journa

Tool support for reasoning in display calculi

We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone. As an example, we implement the display calculus D.EAK of dynamic epistemic logic. Second, we provide embeddings of the calculus in the theorem prover Isabelle for formalising proofs about D.EAK. As a case study we show that the solution of the muddy children puzzle is derivable for any number of muddy children. Third, there is a set of meta-tools, that allows us to adapt the tool for a wide variety of user defined calculi