This electronic document serves as a guide on how to get a LAMP stack running on a Google Compute Engine virtual machine instance running Debian.

Today, soft computing is a field that is used a lot in solving real-world problems, such as problems in economics, finance, banking... With the aim to serve for solving the real problem, many new theories and/or tools which were proposed, improved to help soft computing used more efficiently. We can mention some theories as fuzzy sets theory (L. Zadeh, 1965), intuitionistic fuzzy set (K Atanasov, 1986), neutrosophic set (F. Smarandache 1999). In this paper, we introduce a new notion of sup (...) port-neutrosophic set (SNS), which is the combination a neutrosophic set with a fuzzy set. So, SNS set is a direct extension of fuzzy set and neutrosophic sets (F. Smarandache). Then, we define some operators on the support-neutrosophic sets, and investigate some properties of these operators. (shrink)

An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

The development of technology is unbelievably rapid. From limited local networks to high speed Internet, from crude computing machines to powerful semi-conductors, the world had changed drastically compared to just a few decades ago. In the constantly renewing process of adapting to such an unnaturally high-entropy setting, innovations as well as entirely new concepts, were often born. In the business world, one such phenomenon was the creation of a new type of entrepreneurship. This paper proposes a new academic discipline of (...) computational entrepreneurship, which centers on: (i) an exponentially growing (and less expensive) computing power, to the extent that almost everybody in a modern society can own and use that; (ii) omnipresent high-speed Internet connectivity, wired or wireless, representing our modern day’s economic connectomics; (iii) growing concern of exploiting “serendipity” for a strategic commercial advantage; and (iv) growing capabilities of lay people in performing calculations for their informed decisions in taking fast-moving entrepreneurial opportunities. Computational entrepreneurship has slowly become a new mode of operation for business ventures and will likely bring the academic discipline of entrepreneurship back to mainstream economics. (shrink)

This book addresses key conceptual issues relating to the modern scientific and engineering use of computer simulations. It analyses a broad set of questions, from the nature of computer simulations to their epistemological power, including the many scientific, social and ethics implications of using computer simulations. The book is written in an easily accessible narrative, one that weaves together philosophical questions and scientific technicalities. It will thus appeal equally to all academic scientists, engineers, and researchers in industry interested in questions (...) related to the general practice of computer simulations. (shrink)

This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in human history, even at moments in the distant future, this set is finite. (...) But then, given fundamental results in recursion theory, the set will also be recursive, recursively enumerable, axiomatizable, and could be the output of a Turing machine. We then argue that it is impossible to produce a string of symbols that humans could possibly produce but no Turing machine could. Moreover, we show that any given string of symbols that we could produce could also be the output of a Turing machine. Our arguments have implications for Hilbert’s sixth problem and the possibility of axiomatizing particular sciences, they undermine at least two distinct arguments against the possibility of Artificial Intelligence, and they entail that expert systems that are the equals of human experts are possible, and so at least one of the goals of Artificial Intelligence can be realized, at least in principle. (shrink)

In his 1950 paper “Computing Machinery and Intelligence,” Alan Turing proposed that we can determine whether a machine thinks by considering whether it can win at a simple imitation game. A neutral questioner communicates with two different systems – one a machine and a human being – without knowing which is which. If after some reasonable amount of time the machine is able to fool the questioner into identifying it as the human, the machine wins the game, and we should (...) conclude that it thinks. This imitation game, now known as the Turing Test, has been much discussed by philosophers of mind, and for more than half a century now there has been considerable debate about whether it is an adequate test for thinking. But what has not been much discussed are the sexed presuppositions underlying the test. Too often forgotten in the philosophical discussion is the fact that Turing’s imitation game is modeled on an imitation game in which a neutral questioner communicates with two different humans – one a man and one a woman – without knowing which is which. In this original imitation game, the man wins the game if he is able to fool the questioner into identifying him as the woman. In this paper, I explore the implications of this set-up. As I argue, the fact that the Turing test was modeled on a man/woman imitation game seems to have led us astray in various ways in our attempt to conduct an effective investigation and assessment of computer intelligence. (shrink)

This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed for the (...) potential information of the world to actualize. Starting from the definition of information as the difference in one physical system that makes a difference in another physical system – which combines Bateson and Hewitt’s definitions, the argument is advanced for natural computation as a computational model of the dynamics of the physical world, where information processing is constantly going on, on a variety of levels of organization. This setting helps us to elucidate the relationships between computation, information, agency and cognition, within the common conceptual framework, with special relevance for biology and robotics. (shrink)

This work addresses a broad range of questions which belong to four fields: computation theory, general philosophy of science, philosophy of cognitive science, and philosophy of mind. Dynamical system theory provides the framework for a unified treatment of these questions. ;The main goal of this dissertation is to propose a new view of the aims and methods of cognitive science--the dynamical approach . According to this view, the object of cognitive science is a particular set of dynamical systems, which I (...) call "cognitive systems". The goal of a cognitive study is to specify a dynamical model of a cognitive system, and then use this model to produce a detailed account of the specific cognitive abilities of that system. The dynamical approach does not limit a-priori the form of the dynamical models which cognitive science may consider. In particular, this approach is compatible with both computational and connectionist modeling, for both computational systems and connectionist networks are special types of dynamical systems. ;To substantiate these methodological claims about cognitive science, I deal first with two questions in two different fields: What is a computational system? What is a dynamical explanation of a deterministic process? ;Intuitively, a computational system is a deterministic system which evolves in discrete time steps, and which can be described in an effective way. In chapter 1, I give a formal definition of this concept which employs the notions of isomorphism between dynamical systems, and of Turing computable function. In chapter 2, I propose a more comprehensive analysis which is based on a natural generalization of the concept of Turing machine. ;The goal of chapter 3 is to develop a theory of the dynamical explanation of a deterministic process. By a "dynamical explanation" I mean the specification of a dynamical model of the system or process which we want to explain. I start from the analysis of a specific type of explanandum--dynamical phenomena--and I then use this analysis to shed light on the general form of a dynamical explanation. Finally, I analyze the structure of those theories which generate explanations of this form, namely dynamical theories. (shrink)

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (shrink)

In this book the authors introduce and study the following notions: Neutrosophic Crisp Points, Neutrosophic Crisp Relations, Neutrosophic Crisp Sets, Neutrosophic Set Generated by (Characteristic Function), alpha-cut Level for Neutrosophic Sets, Neutrosophic Crisp Continuous Function, Neutrosophic Crisp Compact Spaces, Neutrosophic Crisp Nearly Open Sets, Neutrosophic Crisp Ideals, Neutrosophic Crisp Filter, Neutrosophic Crisp Local Functions, Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals, Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity, Neutrosophic Topological Region, Neutrosophic Closed Set and Neutrosophic Continuous Function, etc. They compute (...) the distances between neutrosophic sets and extend it to Neutrosophic Hesitancy Degree. The authors also generalize the Crisp Topological Space and Intuitionistic Topological Space to the notion of Neutrosophic Crisp Topological Space. At the end, they present applications to Neutrosophic Database, and show a security scheme based on Public Key Infrastructure (PKI) using Neutrosophic Logic Manipulation. The authors utilize neutrosophic sets in order to analyze social networks data conducted through learning activities, and for the Geographical Information Systems (GIS) they employ fundamental concepts and properties of a Neutrosophic Spatial Region. Keywords: Neutrosophic Crisp Points; Neutrosophic Crisp Relations; Neutrosophic Crisp Sets; Neutrosophic Crisp Continuous Function; Neutrosophic Crisp Compact Spaces; Neutrosophic Crisp Nearly Open Sets; Neutrosophic Crisp Ideals; Neutrosophic Crisp Filter; Neutrosophic Crisp Local Functions; Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals; Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity; Neutrosophic Topological Region; Neutrosophic Closed Set and Neutrosophic Continuous Function; Neutrosophic Hesitancy Degree; Neutrosophic Crisp Topological Space; Neutrosophic Database; Neutrosophic Logic Manipulation; Neutrosophic Spatial Region. (shrink)

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...) evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert’s program due to Simpson [1988], and predicativism in the extended form due to Feferman and Schütte. -/- Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0. (shrink)

This paper presents the first bibliometric mapping analysis of the field of computer and information ethics (C&IE). It provides a map of the relations between 400 key terms in the field. This term map can be used to get an overview of concepts and topics in the field and to identify relations between information and communication technology concepts on the one hand and ethical concepts on the other hand. To produce the term map, a data set of over thousand articles (...) published in leading journals and conference proceedings in the C&IE field was constructed. With the help of various computer algorithms, key terms were identified in the titles and abstracts of the articles and co-occurrence frequencies of these key terms were calculated. Based on the co-occurrence frequencies, the term map was constructed. This was done using a computer program called VOSviewer. The term map provides a visual representation of the C&IE field and, more specifically, of the organization of the field around three main concepts, namely privacy, ethics, and the Internet. (shrink)

Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically (...) during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly. (shrink)

The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...) important implications for turing machine functionalism and the prospect of ‘conscious’ machines. In the paper, instead of seeking to develop Putnam’s claim that, “everything implements every finite state automata”, I will try to establish the weaker result that, “everything implements the specific machine Q on a particular input set ( x )”. Then, equating Q ( x ) to any putative AI program, I will show that conceding the ‘strong AI’ thesis for Q (crediting it with mental states and consciousness) opens the door to a vicious form of panpsychism whereby all open systems, (e.g. grass, rocks etc.), must instantiate conscious experience and hence that disembodied minds lurk everywhere. (shrink)

Although Paul Churchland and Jerry Fodor both subscribe to the so-called theory-theory– the theory that folk psychology (FP) is an empirical theory of behavior – they disagree strongly about FP’s fate. Churchland contends that FP is a fundamentally flawed view analogous to folk biology, and he argues that recent advances in computational neuroscience and connectionist AI point toward development of a scientifically respectable replacement theory that will give rise to a new common-sense psychology. Fodor, however, wagers that FP will be (...) largely preserved and vindicated by scientific investigations of behavior. Recent findings by developmental psychologists, I argue, will push both Churchlandians and Fodorians toward the pessimistic view that FP is a misguided theory that will never be displaced, because it is, so to speak, built into our cognitive systems. I explore the possibility of preserving optimism by rejecting the theory-theory and adopting the simulation theory, a competing view developed by Robert Gordon, Alvin Goldman, and Jane Heal. According to simulationists, common-sense interpretation of behavior is accomplished by means of pretense-like operations that deploy the cognitive system’s own reasoning capabilities in a disengaged manner. Since on this view no theory-like set of principles would be needed, the simulation theory seems to enjoy a simplicity advantage over the theory-theory. Steven Stich and Shawn Nichols, however, contend that as the cognitive system would require special mechanisms for disengaged operation, the simplicity question cannot be resolved until suitable computational models are developed. I describe a set of models I have constructed to meet this need, and I discuss the contribution such models can make to determining FP’s fate. (shrink)

A recently developed computational methodology for executing numerical calculations with infinities and infinitesimals is described in this paper. The approach developed has a pronounced applied character and is based on the principle “The part is less than the whole” introduced by the ancient Greeks. This principle is applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The point of view on infinities and infinitesimals (and in general, on Mathematics) presented in this paper (...) uses strongly physical ideas emphasizing interrelations that hold between a mathematical object under observation and the tools used for this observation. It is shown how a new numeral system allowing one to express different infinite and infinitesimal quantities in a unique framework can be used for theoretical and computational purposes. Numerous examples dealing with infinite sets, divergent series, limits, and probability theory are given. (shrink)

Throughout this paper, we prove TC+CON(〖TC〗^* )ͰP≠NP. To do that, firstly, we introduce the definition of scope_^*. This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face a finite number of efficiently computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world of computation, (...) in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P≠NP and 〖 P〗^*≠NP^*. Throughout this article, we discuss around the impact of TC^* on TC. (shrink)

Intelligent tutoring system (ITS) is a computer system which aims to provide immediate and customized or reactions to learners, usually without the intervention of human teacher's instructions. Secretariats professional to have the common goal of learning a meaningful and effective manner through the use of a variety of computing technologies enabled. There are many examples of professional Secretariats used in both formal education and in professional settings that have proven their capabilities. There is a close relationship between private lessons intelligent, (...) cognitive learning and design theories; and there are ongoing to improve the effectiveness of ITS research. And it aims to find a solution to the problem of over-reliance on students' teachers for quality education. The program aims to provide access to high-quality education to every student, and therefore the reform of the education system as a whole. In this paper, we will use Intelligent Tutoring System Builder (ITSB) to build an education system on cloud computing in terms of the concept of cloud computing and components and how to take advantage of cloud computing in the field. (shrink)

Research in multi-agent systems typically assumes a regulative model of social practice. This model starts with agents who are already capable of acting autonomously to further their individual ends. A social practice, according to this view, is a way of achieving coordination between multiple agents by restricting the set of actions available. For example, in a world containing cars but no driving regulations, agents are free to drive on either side of the road. To prevent collisions, we introduce driving regulations, (...) insisting that everyone drives on the left hand side of the road. We accept this limitation on our freedom because it lowers the probability of a collision. -/- This paper describes AI systems that are based on the constitutive view of social practice. According to this alternative view, there are certain actions that are only available to the agent because he is participating in a practice of a certain sort. For example, you can swing a peculiarly shaped piece of wood without participating in any particular practice - but this action will only constitute a strike if you are participating in a game of baseball. I can raise my hand whenever I like, but this only counts as voting for the motion within the institution of voting. But not all the examples are from frivolous, optional or institutional activities. Sellars and Brandom argue that even the fundamental act of assertion is only possible within the context of a particular social practice: the Game of Giving and Asking for Reasons. -/- The constitutive view, which is familiar to philosophers, is relatively unknown within the AI community. -/- The central aim of this paper is to show how the constitutive view of practice can be put to use in AI applications. (shrink)

Intelligent tutoring system (ITS) is a computer system which aims to provide immediate and customized or reactions to learners, usually without the intervention of human teacher's instructions. Secretariats professional to have the common goal of learning a meaningful and effective manner through the use of a variety of computing technologies enabled. There are many examples of professional Secretariats used in both formal education and in professional settings that have proven their capabilities. There is a close relationship between private lessons intelligent, (...) cognitive learning and design theories; and there are ongoing to improve the effectiveness of ITS research. And it aims to find a solution to the problem of over-reliance on students' teachers for quality education. The program aims to provide access to high-quality education to every student, and therefore the reform of the education system as a whole. In this paper, we will use Intelligent Tutoring System Builder (ITSB) to build an education system on cloud computing in terms of the concept of cloud computing and components and how to take advantage of cloud computing in the field. (shrink)

The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to "0", individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.

Cognitive representations are typically analysed in terms of content, vehicle and format. While current work on formats appeals to intuitions about external representations, such as words and maps, in this paper we develop a computational view of formats that does not rely on intuitions. In our view, formats are individuated by the computational profiles of vehicles, i.e., the set of constraints that fix the computational transformations vehicles can undergo. The resulting picture is strongly pluralistic, it makes space for a variety (...) of different formats, and is intimately tied to the computational approach to cognition in cognitive science and artificial intelligence. (shrink)

Emotions and feelings (i.e. affects) are a central feature of human behavior. Due to complexity and interdisciplinarity of affective phenomena, attempts to define them have often been unsatisfactory. This article provides a simple logical structure, in which affective concepts can be defined. The set of affects defined is similar to the set of emotions covered in the OCC model, but the model presented in this article is fully computationally defined, whereas the OCC model depends on undefined concepts. Following Matthis, affects (...) are seen as unconscious, emotions as preconscious and feelings as conscious. Affects are thus a superclass of emotions and feelings with regards to consciousness. A set of affective states and related affect-specific behaviors and strategies can be defined with unconscious affects only. -/- In addition, affects are defined as processes of change in the body state, that have specific triggers. For example, an affect of hope is defined as a specific body state that is triggered when the agent is becomes informed about a future event, that is positive with regards to the agent’s needs. -/- Affects are differentiated from each other by types of causing events. Affects caused by unexpected positive, neutral and negative events are delight, surprise and fright, respectively. Affects caused by expected positive and negative future events are hope and fear. -/- Affects caused by expected past events are as follows: satisfaction results from a positive expectation being fulfilled, disappointment results from a positive expectation not being fulfilled, fears-confirmed results from a negative expectation being fulfilled, and relief results from a negative expectation not being fulfilled. Pride is targeted towards a self-originated positive event, and shame towards a self-originated negative event. Remorse is targeted towards a self-originated action causing a negative event. Pity is targeted towards a liked agent experiencing a negative event, and happy-for towards a liked agent experiencing a positive event. Resentment is targeted towards a disliked agent experiencing a positive event, and gloating towards a disliked agent experiencing a negative event. An agent is liked/loved if it has produced a net utility greater than zero, and disliked/hated if the net utility is lower than zero. An agent is desired if it is expected to produce a positive net utility in the future, and disliked if the expected net utility is negative. -/- The above model for unconscious affects is easily computationally implementable, and may be used as a starting point in building believable simulation models of human behavior. The models can be used as a starting point in the development of computational psychological, psychiatric, sociological and criminological theories, or in e.g. computer games. -/- [please cite using the arXiv url below.]. (shrink)

The paper addresses Leon Hen.kin's proposition as a " lighthouse", which can elucidate a vast territory of knowledge uniformly: logic, set theory, information theory, and quantum mechanics: Two strategies to infinity are equally relevant for it is as universal and t hus complete as open and thus incomplete. Henkin's, Godel's, Robert Jeroslow's, and Hartley Rogers' proposition are reformulated so that both completeness and incompleteness to be unified and thus reduced as a joint property of infinity and of all infinite sets. (...) However, only Henkin's proposition equivalent to an internal position to infinity is consistent . This can be retraced back to set theory and its axioms, where that of choice is a key. Quantum mechanics is forced to introduce infinity implicitly by Hilbert space, on which is founded its formalism. One can demonstrate that some essential properties of quantum information, entanglement, and quantum computer originate directly from infinity once it is involved in quantum mechanics. Thus, these phenomena can be elucidated as both complete and incomplete, after which choice is the border between them. A special kind of invariance to the axiom of choice shared by quantum mechanics is discussed to be involved that border between the completeness and incompleteness of infinity in a consistent way. The so-called paradox of Albert Einstein, Boris Podolsky, and Nathan Rosen is interpreted entirely in the same terms only of set theory. Quantum computer can demonstrate especially clearly the privilege of the internal position, or " observer'' , or "user" to infinity implied by Henkin's proposition as the only consistent ones as to infinity. An essential area of contemporary knowledge may be synthesized from a single viewpoint. (shrink)

Cloud computing is considered as a new type of technology, in fact, it is an extension of the information technology's developments which are based on the pooling of resources and infrastructure to provide services depend on using the cloud, in the sense that instead of these services and resources exist on local servers or personal devices, they are gathered in the cloud and be shared on the Internet. This technology has achieved an economic success no one can deny it and (...) resorting to use it has many advantages, today it becomes known and recognized and begins to invade the libraries' area and imposes itself day by day because of the benefits afforded by using applications that have the ability to change the nature of library's services through the web hosting services which can be accessed via any internet connected device. And actually, libraries started using services provided by this technology especially in the field of digitization, indexing, supply, storage and the service of sharing and exchanging information resources in the virtual environment. For this, there is a need to conduct scientific research to find out librarians' trends and motivations about the use of cloud computing in their field of work. Where this research examines the librarians' trends towards the use of cloud computing according to the technology acceptance model (TAM). The study depended on descriptive analytical method using a questionnaire tool, and it has included all the libraries of Mentouri-Constantine1, libraries of university Abdelhamid Mehri-Constantine2, libraries of university Constantine 3, and libraries of Emir Abdelkader university of the Islamic science. And it reached a set of results including: that cloud computing is not used in a very large proportion by librarians, and they haven't a good cognitive level of its services, but in return, an interest was found by them to the cloud as a technology helps the office work implementation and the performance efficiency lifting and appreciates library services. (shrink)

The incompleteness of set theory ZF C leads one to look for natural nonconservative extensions of ZF C in which one can prove statements independent of ZF C which appear to be “true”. One approach has been to add large cardinal axioms.Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski-Grothendieck set theory T G or It is a nonconservative extension of ZF C and is obtained from other axiomatic set theories by the inclusion of Tarski’s axiom (...) which implies the existence of inaccessible cardinals. See also related set theory with a filter quantifier ZF (aa). In this paper we look at a set theory NC# ∞# , based on bivalent gyper infinitary logic with restricted Modus Ponens Rule In this paper we deal with set theory NC# ∞# based on bivalent gyper infinitary logic with Restricted Modus Ponens Rule. Nonconservative extensions of the canonical internal set theories IST and HST are proposed. (shrink)

In this paper, I revisit Frege's theory of sense and reference in the constructive setting of the meaning explanations of type theory, extending and sharpening a program–value analysis of sense and reference proposed by Martin-Löf building on previous work of Dummett. I propose a computational identity criterion for senses and argue that it validates what I see as the most plausible interpretation of Frege's equipollence principle for both sentences and singular terms. Before doing so, I examine Frege's implementation of his (...) theory of sense and reference in the logical framework of Grundgesetze, his doctrine of truth values, and views on sameness of sense as equipollence of assertions. (shrink)

Brain-computer interfaces (BCIs) are an emerging and converging technology that translates the brain activity of its user into command signals for external devices, ranging from motorized wheelchairs, robotic hands, environmental control systems, and computer applications. In this paper I functionally decompose BCI systems and categorize BCI applications with similar functional properties into three categories, those with (1) motor, (2) virtual, and (3) linguistic applications. I then analyse the relationship between these distinct BCI applications and their users from an epistemological and (...) phenomenological perspective. Specifically, I analyse functional properties of BCIs in relation to the abilities (particularly motor behaviour and communication) of their human users, asking how they may or may not extend these abilities. This includes a phenomenological analysis of whether BCIs are experienced as transparent extensions. Contrary to some recent philosophical claims, I conclude that, although BCIs have the potential to become bodily as well as cognitive extensions for skilled users, at this stage they are not. And while the electrodes and signal processor may to a variable degree be transparent and incorporated, the BCI system as a whole is not. Contemporary BCIs are difficult to use. Most systems only work in highly controlled laboratory settings, require a high amount of training and concentration, have very limited control options, have low and variable information transfer rates, and effector motions are often slow, clumsy and sometimes unsuccessful. These drawbacks considerably limit their possibilities for transparency and incorporation into either the body schema or cognitive system which is essential for bodily and cognitive extension. Current BCIs can therefore only be seen as a weak or metaphorical extension of the human central nervous system. To increase their potential for cognitive extension, I give suggestions for improving the interface design of what I refer to as linguistic applications. (shrink)

We study active set methods for optimization problems in Block Angular Form (BAF). We begin by reviewing some standard basis factorizations, including Saunders' orthogonal factorization and updates for the simplex method that do not impose any restriction on the pivot sequence and maintain the basis factorization structured in BAF throughout the algorithm. We then suggest orthogonal factorization and updating procedures that allow coarse grain parallelization, pivot updates local to the affected blocks, and independent block reinversion. A simple parallel environment appropriate (...) to the description and complexity analysis of test procedures is defined in Section 5. The factorization and updating procedures are presented in Sections 6 and 7. Our update procedure outperforms conventional Updating procedures even in a purely sequential environment. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...) flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

In this paper intuitionistic set theory INC# in infinitary set theoretical language is considered. External induction principle in nonstandard intuitionistic arithmetic were derived. Non trivial application in number theory is considered.

Persons with aphasia suffer from a loss of communication ability as a consequence of a brain injury. A small strand of research indicates effec- tiveness of dialogic interventions for communication development for persons with aphasia, but a vast amount of research studies shows its effectiveness for other target groups. In this paper, we describe the main parts of the hitherto technological development of an application named Dialogica that is (i) aimed at facilitating increased communicative participation in dialogic settings for persons (...) with aphasia and other communication disorders, (ii) based on comput- er game technology as well as on theory in dialogic education and argumenta- tion theory, and (iii) designed for mobile devices with larger screens. (shrink)

Throughout what is now the more than 50-year history of the computer many theories have been advanced regarding the contribution this machine would make to changes both in the structure of society and in ways of thinking. Like other theories regarding the future, these should also be taken with a pinch of salt. The history of the development of computer technology contains many predictions which have failed to come true and many applications that have not been foreseen. While we must (...) reserve judgment as to the question of the impact on the structure of society and human thought, there is no reason to wait for history when it comes to the question: what are the properties that could give the computer such far-reaching importance? The present book is intended as an answer to this question. The fact that this is a theoretical analysis is due to the nature of the subject. No other possibilities are available because such a description of the properties of the computer must be valid for any kind of application. An additional demand is that the description should be capable of providing an account of the properties which permit and limit these possible applications, just as it must make it possible to characterize a computer as distinct from a) other machines whether clocks, steam engines, thermostats, or mechanical and automatic calculating machines, b) other symbolic media whether printed, mechanical, or electronic and c) other symbolic languages whether ordinary languages, spoken or written or formal languages. This triple limitation, however, (with regard to other machines, symbolic media and symbolic languages) raises a theoretical question as it implies a meeting between concepts of mechanical-deterministic systems, which stem from mathematical physics, and concepts of symbolic systems which stem from the description of symbolic activities common to the humanities. The relationship between science and the humanities has traditionally been seen from a dualistic perspective, as a relationship between two clearly separate subject areas, each studied on its own set of premises and using its own methods. In the present case, however, this perspective cannot be maintained since there is both a common subject area and a new - and specific - kind of interaction between physical and symbolic processes. (shrink)

A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework. The (...) new methodology has allowed us to introduce the Infinity Computer working with such numbers (its simulator has already been realized). Examples dealing with divergent series, infinite sets, and limits are given. (shrink)

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) by (...) different mathematical languages (the instruments of investigation). Together with traditional mathematical languages using such concepts as ‘enumerable sets’ and ‘continuum’ a new computational methodology allowing one to measure the number of elements of different infinite sets is used in this paper. It is shown how mathematical languages used to describe the machines limit our possibilities to observe them. In particular, notions of observable deterministic and non-deterministic Turing machines are introduced and conditions ensuring that the latter can be simulated by the former are established. (shrink)

In philosophy of language, a distinction has been proposed between two aspects of lexical competence, i.e. referential and inferential competence (Marconi 1997). The former accounts for the relationship of words to the world, the latter for the relationship of words among themselves. The distinction may simply be a classification of patterns of behaviour involved in ordinary use of the lexicon. Recent research in neuropsychology and neuroscience, however, suggests that the distinction might be neurally implemented, i.e., that different cognitive architectures with (...) partly distinct neural realizations might be responsible for cognitive performances involving inferential and referential aspects of semantics. This hypothesis is strongly consistent with patient data supporting the notion of a functional double dissociation between inferential and referential abilities, and with a set of direct cortical mapping studies and neuroimaging experiments suggesting that inferential and referential abilities are underpinned by at least partly different regions of the human brain (e.g., Marconi et al. 2013; review in Calzavarini 2017). The initial hypotheses formulated in the setting of the philosophy of language, along with the neuropsychological experimental evidence (about how referential and inferential competences may be neurally instantiated) can be the input to computational modelling activities involving the inferential and the referential aspects of lexical competence. The aim of the talk is to offer a critical discussion of the kind of formalisms that can be used to model the two aspects of lexical competence, and of the main difficulties related to the use of these computational techniques. -/- Inferential (=symbolic) vs referential (=connectionist) formalisms. (shrink)

We show how faceted search using a combination of traditional classification systems and mixed-membership topic models can go beyond keyword search to inform resource discovery, hypothesis formulation, and argument extraction for interdisciplinary research. Our test domain is the history and philosophy of scientific work on animal mind and cognition. The methods can be generalized to other research areas and ultimately support a system for semi-automatic identification of argument structures. We provide a case study for the application of the methods to (...) the problem of identifying and extracting arguments about anthropomorphism during a critical period in the development of comparative psychology. We show how a combination of classification systems and mixed-membership models trained over large digital libraries can inform resource discovery in this domain. Through a novel approach of “drill-down” topic modeling—simultaneously reducing both the size of the corpus and the unit of analysis—we are able to reduce a large collection of fulltext volumes to a much smaller set of pages within six focal volumes containing arguments of interest to historians and philosophers of comparative psychology. The volumes identified in this way did not appear among the first ten results of the keyword search in the HathiTrust digital library and the pages bear the kind of “close reading” needed to generate original interpretations that is the heart of scholarly work in the humanities. Zooming back out, we provide a way to place the books onto a map of science originally constructed from very different data and for different purposes. The multilevel approach advances understanding of the intellectual and societal contexts in which writings are interpreted. (shrink)

Criticism of big data has focused on showing that more is not necessarily better, in the sense that data may lose their value when taken out of context and aggregated together. The next step is to incorporate an awareness of pitfalls for aggregation into the design of data infrastructure and institutions. A common strategy minimizes aggregation errors by increasing the precision of our conventions for identifying and classifying data. As a counterpoint, we argue that there are pragmatic trade-offs between precision (...) and ambiguity that are key to designing effective solutions for generating big data about biodiversity. We focus on the importance of theory-dependence as a source of ambiguity in taxonomic nomenclature and hence a persistent challenge for implementing a single, long-term solution to storing and accessing meaningful sets of biological specimens. We argue that ambiguity does have a positive role to play in scientific progress as a tool for efficiently symbolizing multiple aspects of taxa and mediating between conflicting hypotheses about their nature. Pursuing a deeper understanding of the trade-offs and synthesis of precision and ambiguity as virtues of scientific language and communication systems then offers a productive next step for realizing sound, big biodiversity data services. (shrink)

In this paper, we bring together research on complex problem solving with that on motivational psychology about goal setting. Complex problems require motivational effort because of their inherent difficulties. Goal Setting Theory has shown with simple tasks that high, specific performance goals lead to better performance outcome than do-your-best goals. However, in complex tasks, learning goals have proven more effective than performance goals. Based on the Zurich Resource Model, so-called motto-goals should activate a person’s resources through positive affect. It was (...) found that motto-goals are effective with unpleasant duties. Therefore, we tested the hypothesis that motto-goals outperform learning and performance goals in the case of complex problems. A total of N = 123 subject participated in the experiment. In dependence of their goal condition, subjects developed a personal motto, learning, or performance goal. This goal was adapted for the computer-simulated complex scenario Tailorshop, where subjects worked as managers in a small fictional company. Other than expected, there was no main effect of goal condition for the management performance. An unexpected gender effect revealed better performance for men than women, pointing to a potential stereotype threat. As hypothesized, motto goals led to higher positive and lower negative affect than the other two goal types. Even though positive affect decreased and negative affect increased in all three groups during Tailorshop completion, participants with motto goals reported the lowest rates of negative affect. Exploratory analyses investigated the role of affect in complex problem solving via mediational analyses and the influence of goal type on perceived goal attainment. (shrink)

Intelligent neurotechnology is an emerging field that combines neurotechnologies like brain-computer interface (BCI) with artificial intelligence. This paper introduces a capability framework to assess the responsible use of intelligent BCI systems and provide practical ethical guidance. It proposes two tests, the threshold and flourishing tests, that BCI applications must meet, and illustrates them in a series of cases. After a brief introduction (Section 1), Section 2 sets forth the capability view and the two tests. It illustrates the threshold test using (...) examples from clinical medicine of BCI applications that enable patients with profound disabilities to function at a threshold level through computer mediation. Section 3 illustrates the flourishing test by exploring possible future applications of BCI involving neuroenhancements for healthy people, using examples adapted from research currently underway in the US military. Section 3 applies a capability lens to a complex case involving dual effects, both therapeutic and non-therapeutic, showing how the threshold and flourishing tests resolve the case. Section 4 replies to three objections: neurorights are the best tool for assessing BCI; the two tests are moving targets; and the analysis utilizes a capability view to do work it is not designed for. The paper concludes that a capability view offers unique advantages and gives practical guidance for evaluating the responsible use of present and future BCI applications. Extrapolating from our analysis may help guide other emerging technologies, such as germline gene editing, expected to impact central human capabilities. (shrink)

The notion of equality between two observables will play many important roles in foundations of quantum theory. However, the standard probabilistic interpretation based on the conventional Born formula does not give the probability of equality between two arbitrary observables, since the Born formula gives the probability distribution only for a commuting family of observables. In this paper, quantum set theory developed by Takeuti and the present author is used to systematically extend the standard probabilistic interpretation of quantum theory to define (...) the probability of equality between two arbitrary observables in an arbitrary state. We apply this new interpretation to quantum measurement theory, and establish a logical basis for the difference between simultaneous measurability and simultaneous determinateness. (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)

Throughout this paper, we prove TC + CON(TC*)ͰP ≠ NP. To do that, firstly we introduce the definition of scope∗ . This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face finite number of efficient computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a (...) world of computation, in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P ≠ NP and P* ≠ NP*. Throughout this article, we discuss around the impact of TC* on TC. (shrink)

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and (...) they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics. (shrink)

Main results are: (i) number e^{e} is transcendental; (ii) the both numbers e+π and e-π are irrational.

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite (...) number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

The theorem of Royer and Case states that there exists a limit-computable function β_1:N→N which eventually dominates every computable function δ_1:N→N. We present an alternative proof of this theorem. K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent and publicly available. Any theorem of any mathematician from past or present forever belongs to K. The statement ¬K(P≠NP)∧¬K(P=NP) does not justify the title (...) of the article. We prove: (1) there exists a limit-computable function f:N→N of unknown computability which eventually dominates every function δ:N→N with a single-fold Diophantine representation; (2) for every computable functions g:N→N, there exists a limit-computable function f:N→N of unknown computability such that f eventually dominates every function δ:N→N with a single-fold Diophantine representation and f(n)>g(n) for every n∈N. Both (1) and (2) justify the title of the article. (shrink)

In this article Russell’s paradox and Cantor’s paradox resolved successfully using intuitionistic logic with restricted modus ponens rule.