10,324 research outputs found

    Some Questions Inspired by (Membrane Computing Motivated) Language-Theoretic Models

    Get PDF
    This contribution argues for the proposition that formal models based on the theory of formal grammars and languages are adequate for the study of some computationally relevant properties of agents and multi-agent systems. Some questions are formulated concerning the possibilities to enlarge the universality and realism of such models by considering the possibilities to go with their computing abilities beyond the traditional Turing-computability, and by considering very natural properties of any real (multi-)agent system such as the partially predictable functioning (behavior) of agents, their unreliability, dysfunctions, etc

    Towards a Church-Turing-Thesis for Infinitary Computations

    Full text link
    We consider the question whether there is an infinitary analogue of the Church-Turing-thesis. To this end, we argue that there is an intuitive notion of transfinite computability and build a canonical model, called Idealized Agent Machines (IAMIAMs) of this which will turn out to be equivalent in strength to the Ordinal Turing Machines defined by P. Koepke

    On the Invariance of G\"odel's Second Theorem with regard to Numberings

    Get PDF
    The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices. In this paper I examine the theorem's dependency regarding G\"odel numberings. I introduce deviant numberings, yielding provability predicates satisfying L\"ob's conditions, which result in provable consistency sentences. According to the main result of this paper however, these "counterexamples" do not refute the theorem's prevalent interpretation, since once a natural class of admissible numberings is singled out, invariance is maintained.Comment: Forthcoming in The Review of Symbolic Logi

    Propositional computability logic I

    Full text link
    In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a machine against the environment, their computability as existence of a machine that always wins the game, logical operators as operations on computational problems, and validity of a logical formula as being a scheme of "always computable" problems. The present contribution gives a detailed exposition of a soundness and completeness proof for an axiomatization of one of the most basic fragments of computability logic. The logical vocabulary of this fragment contains operators for the so called parallel and choice operations, and its atoms represent elementary problems, i.e. predicates in the standard sense. This article is self-contained as it explains all relevant concepts. While not technically necessary, however, familiarity with the foundational paper "Introduction to computability logic" [Annals of Pure and Applied Logic 123 (2003), pp.1-99] would greatly help the reader in understanding the philosophy, underlying motivations, potential and utility of computability logic, -- the context that determines the value of the present results. Online introduction to the subject is available at http://www.cis.upenn.edu/~giorgi/cl.html and http://www.csc.villanova.edu/~japaridz/CL/gsoll.html .Comment: To appear in ACM Transactions on Computational Logi
    • …
    corecore