Computation Environments (2) Persistently Evolutionary Semantics
نویسنده
چکیده
In the manuscript titled " Computation environment (1) " , we introduced a notion called computation environment as an interactive model for computation and complexity theory. In this model, Turing machines are not autonomous entities and find their meanings through the interaction between a computist and a universal processor, and thus due to evolution of the universal processor, the meanings of Turing machines could change. In this manuscript, we discuss persistently evolutionary intensions. We introduce a new semantics, called persistently evolutionary semantics, for predicate logic that the meaning of function and predicate symbols are not already predetermined, and predicate and function symbols find their meaning through the interaction of the subject with the language. In (classic) model theory, the mathematician who studies a structure is assumed as a god who lives out of the structure, and the study of the mathematician does not effect the structure. The meaning of predicate and function symbols are assumed to be independent of the mathematician who does math. The persistently evolutionary semantics could be regarded as a start of " Interactive Model Theory " as a new paradigm in model theory (similar to the paradigm of interactive computation). In interactive model theory, we suppose that a mathematical structure should consist of two parts: 1) an intelligent agent (a subject), and 2) an environment (language), and every things should find its meaning through the interaction of these two parts. We introduce persistently evolutionary Kripke structure for propositional and predicate logic. Also, we propose a persistently evolutionary Kripke semantics for the notion of computation, where the intension of a code of a Turing machine persistently evolve. We show that in this Kripke model the subject can never know P = NP.
منابع مشابه
Computation Environments, An Interactive Semantics for Turing Machines (which P is not equal to NP considering it)
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the computation environment. A computation environment consists of two main parts: i) a universal processor and ii) a computist who uses the computability power of the universal processor to perform effective procedures. The notion of computation finds ...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملA generalization of the Chen-Wu duality into quantale-valued setting
With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...
متن کاملExplicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments
Problem optimization in dynamic environments has atrracted a growing interest from the evolutionary computation community in reccent years due to its importance in real world optimization problems. Several approaches have been developed to enhance the performance of evolutionary algorithms for dynamic optimization problems, of which the memory scheme is a major one. This chapter investigates th...
متن کاملEvolutionary dynamic optimization: A survey of the state of the art
Optimization in dynamic environments is a challenging but important task since many real-world optimization problems are changing over time. Evolutionary computation and swarm intelligence are good tools to address optimization problems in dynamic environments due to their inspiration from natural self-organized systems and biological evolution, which have always been subject to changing enviro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1207.0051 شماره
صفحات -
تاریخ انتشار 2012