Where AR is the set of arithmetic Turing degrees, 0 (ω ) is the least member of { $\mathbf{\alpha}^{(2)}|\mathbf{a}$ is an upper bound on AR}. This situation is quite different if we examine HYP, the set of hyperarithmetic degrees. We shall prove (Corollary 1) that there is an a, an upper bound on HYP, whose hyperjump is the degree of Kleene's O. This paper generalizes this example, using an iteration of the jump operation into the transfinite (...) which is based on results of Jensen and is detailed in [3] and [4]. In $\S1$ we review the basic definitions from [3] which are needed to state the general results. (shrink)

Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The result extends to exact pairs for the hyperarithmetic degrees.

In this paper I begin by extending two results of Solovay; the first characterizes the possible Turing degrees of models of True Arithmetic (TA), the complete first-order theory of the standard model of PA, while the second characterizes the possible Turing degrees of arbitrary completions of P. I extend these two results to characterize the possible Turing degrees of m-diagrams of models of TA and of arbitrary complete extensions of PA. I next give (...) a construction showing that the conditions Solovay identified for his characterization of degrees of models of arbitrary completions of PA cannot be dropped (I showed that these conditions cannot be simplified in the paper. (shrink)

Where $\underline{a}$ is a Turing degree and ξ is an ordinal $ , the result of performing ξ jumps on $\underline{a},\underline{a}^{(\xi)}$ , is defined set-theoretically, using Jensen's fine-structure results. This operation appears to be the natural extension through $(\aleph_1)^{L^\underline{a}}$ of the ordinary jump operations. We describe this operation in more degree-theoretic terms, examine how much of it could be defined in degree-theoretic terms and compare it to the single jump operation.

Let I be a countable jump ideal in $\mathscr{D} = \langle \text{The Turing degrees}, \leq\rangle$ . The central theorem of this paper is: a is a uniform upper bound on I iff a computes the join of an I-exact pair whose double jump a (1) computes. We may replace "the join of an I-exact pair" in the above theorem by "a weak uniform upper bound on I". We also answer two minimality questions: the class of uniform upper bounds (...) on I never has a minimal member; if ∪ I = L α [ A] ∩ ω ω for α admissible or a limit of admissibles, the same holds for nice uniform upper bounds. The central technique used in proving these theorems consists in this: by trial and error construct a generic sequence approximating the desired object; simultaneously settle definitely on finite pieces of that object; make sure that the guessing settles down to the object determined by the limit of these finite pieces. (shrink)

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 Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this (...) uncertainty and loss of information, the concept of arithmetic logical entropy can be used. The Turing machine and its equivalent, general recursive functions can be understood through the λ calculus and the Turing/Church thesis. However, there are certain recursive functions that cannot be fully understood or predicted by other algorithms due to the loss of information during logical-arithmetic operations. In other words, the behaviour of these functions cannot be completely determined at every stage of the computation due to a lack of information in their definition. While there are some cases where the behaviour of recursive functions is highly predictable, the lack of information in most cases makes it impossible for algorithms to determine if a program will halt or not. This inability to predict the outcome of the computation is the essence of the halting problem of the Turing machine. Even in cases where more information is available about the program, it is still difficult to determine with certainty if the program will halt or not. This also highlights the importance of the Turing oracle machine, which introduces information from outside the computation to compensate for the lack of information and ultimately decide the result of the computation. (shrink)

Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by (...) quantum neo-Pythagoreanism links it to the opposition of propositional logic, to which Gentzen’s cut rule refers immediately, on the one hand, and the linguistic and mathematical theory of metaphor therefore sharing the same structure borrowed from Hilbert arithmetic in a wide sense. An example by hermeneutical circle modeled as a dual pair of a syllogism (accomplishable also by a Turing machine) and a relevant metaphor (being a formal and logical mistake and thus fundamentally inaccessible to any Turing machine) visualizes human understanding corresponding also to Gentzen’s cut elimination and the Gödel dichotomy about the relation of arithmetic to set theory: either incompleteness or contradiction. The metaphor as the complementing “half” of any understanding of hermeneutical circle is what allows for that Gödel-like incompleteness to be overcome in human thought. (shrink)

The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So it is (...) with computing, which can be analog or digital, and is often mixed. The theory behind computers is essentially digital, but efficient simulations of phenomena can be performed by analog devices; indeed, any physical calculation requires implementation in the physical world and is therefore analog to some extent, despite being based on abstract logic and arithmetic. The mammalian brain, comprised of neuronal networks, functions as an analog device and has given rise to artificial neural networks that are implemented as digital algorithms but function as analog models would. Analog constructs compute with the implementation of a variety of feedback and feedforward loops. In contrast, digital algorithms allow the implementation of recursive processes that enable them to generate unparalleled emergent properties. We briefly illustrate how the cortical organization of neurons can integrate signals and make predictions analogically. While we conclude that brains are not digital computers, we speculate on the recent implementation of human writing in the brain as a possible digital path that slowly evolves the brain into a genuine (slow) Turing machine. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. (...) We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the (...) interpretation. The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...) verifiably. We consider a constructive interpretation of classical, Tarskian, truth, and of Goedel's reasoning, under which any formal system of Peano Arithmetic---classically accepted as the foundation of all our mathematical Languages---is verifiably complete in the above sense. We show how some paradoxical concepts of Quantum mechanics can, then, be expressed, and interpreted, naturally under a constructive definition of mathematical truth. (shrink)

I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines and (...) more). There are physically and metaphysically possible machines. There is an iterative hierarchy of logically possible machines in the iterative hierarchy of sets. Some algorithms are such that machines that instantiate them are minds. So there is an iterative hierarchy of finitely and transfinitely complex minds. (shrink)

The mind-body problem is one of the important topics in philosophy of mind and cognitive science. Following the analytical tradition of linguistic and logical analysis, we focus on two aspects of the mind- body problem: one is around Gödel's incompleteness theorem, and the other is on cognitive logic, especially on the question of whether Epistemological Arithmetic and machines are private. In the former case, in response to the popular view that the Gödel Incompleteness Theorem supports dualism in the mind-body (...) problem, H. Putnam constructs a counter-argument that defends the computationalist agenda: the equivalence of mind and Turing machine. In this regard, the paper discusses Putnam's line of analysis and then argues that it is unsound. In the latter case, the paper examines in detail the cognitive form of the expression of privateness and concludes, together with recent results in EA, that the existence of privateness in Turing machines is logically untenable and, therefore, we argue that the mind is not equivalent to a machine in terms of cognitive ability and privateness, i.e., the computationalist agenda is not valid. (shrink)

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer (...) would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. (shrink)

Natural argument is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary natural arguments in any data. That ability of natural argument is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer (...) would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. -/- . (shrink)

Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine (...) – Is continuality universal? – Diffeomorphism and velocity – Einstein’s general principle of relativity – „Mach’s principle“ – The Skolemian relativity of the discrete and the continuous – The counterexample in § 6 of their paper – About the classical tautology which is untrue being replaced by the statements about commeasurable quantum-mechanical quantities – Logical hidden parameters – The undecidability of the hypothesis about hidden parameters – Wigner’s work and и Weyl’s previous one – Lie groups, representations, and psi-function – From a qualitative to a quantitative expression of relativity − psi-function, or the discrete by the random – Bartlett’s approach − psi-function as the characteristic function of random quantity – Discrete and/ or continual description – Quantity and its “digitalized projection“ – The idea of „velocity−probability“ – The notion of probability and the light speed postulate – Generalized probability and its physical interpretation – A quantum description of macro-world – The period of the as-sociated de Broglie wave and the length of now – Causality equivalently replaced by chance – The philosophy of quantum information and religion – Einstein’s thesis about “the consubstantiality of inertia ant weight“ – Again about the interpretation of complex velocity – The speed of time – Newton’s law of inertia and Lagrange’s formulation of mechanics – Force and effect – The theory of tachyons and general relativity – Riesz’s representation theorem – The notion of covariant world line – Encoding a world line by psi-function – Spacetime and qubit − psi-function by qubits – About the physical interpretation of both the complex axes of a qubit – The interpretation of the self-adjoint operators components – The world line of an arbitrary quantity – The invariance of the physical laws towards quantum object and apparatus – Hilbert space and that of Minkowski – The relationship between the coefficients of -function and the qubits – World line = psi-function + self-adjoint operator – Reality and description – Does a „curved“ Hilbert space exist? – The axiom of choice, or when is possible a flattening of Hilbert space? – But why not to flatten also pseudo-Riemannian space? – The commutator of conjugate quantities – Relative mass – The strokes of self-movement and its philosophical interpretation – The self-perfection of the universe – The generalization of quantity in quantum physics – An analogy of the Feynman formalism – Feynman and many-world interpretation – The psi-function of various objects – Countable and uncountable basis – Generalized continuum and arithmetization – Field and entanglement – Function as coding – The idea of „curved“ Descartes product – The environment of a function – Another view to the notion of velocity-probability – Reality and description – Hilbert space as a model both of object and description – The notion of holistic logic – Physical quantity as the information about it – Cross-temporal correlations – The forecasting of future – Description in separable and inseparable Hilbert space – „Forces“ or „miracles“ – Velocity or time – The notion of non-finite set – Dasein or Dazeit – The trajectory of the whole – Ontological and onto-theological difference – An analogy of the Feynman and many-world interpretation − psi-function as physical quantity – Things in the world and instances in time – The generation of the physi-cal by mathematical – The generalized notion of observer – Subjective or objective probability – Energy as the change of probability per the unite of time – The generalized principle of least action from a new view-point – The exception of two dimensions and Fermat’s last theorem. (shrink)

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.

The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good measure (...) of the strength of the theory. I exhibit certain strong counterexamples and establish conclusively that the received view is false. Moreover, I show that the limiting constants provided by the theorem do not in any way reflect the power of formalized theories, but that the values of these constants are actually determined by the chosen coding of Turing machines, and are thus quite accidental. (shrink)

I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I (...) argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single (...) valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic (...) number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (shrink)

In this paper I argue that protest images have a certain aesthetics and a degree of transformative power. Crucial to this aesthetics is the images’ narrative struc- ture, like the representation of goal-directed actions. On this basis, I show that there are more aspects that contribute to the storytelling capacity, like narrative characteristics and an aesthetics of dramatization. Using the example of climate change protests as a case study, I establish that these aspects can contribute to the transformative ability of (...) protest images, if used effectively. (shrink)

PHILOSOPHY OF HUMAN RIGHTS: HUMAN RIGHTS IN LIGHT OF THEIR INTERNATIONAL PROTECTION Summary The book consists of two main parts: in the first, on the basis of an analysis of international law, elements of the contemporary conception of human rights and its positive legal protection are identified; in the second - in light of the first part -a philosophical theory of law based on the tradition leading from Plato, Aristotle, and St. Thomas Aquinas is constructed. The conclusion contains an application (...) of the results of the analysis conducted in the second part. The first part comprises four chapters. The first aims at revealing characteristics of human rights on the basis of an analysis of historical conditioning of the inter-national law of human rights and its development. The historical context displays the practical, vindicative, and critical character of the positive legal protection of human rights. Moreover, the process of change of positive human rights law is distinguished from the process of change of human rights as such. In the second chapter the content of human rights - a topic which is only auxiliary to the conducted analysis - is discussed. Basic typology and catalogues of rights proclaimed in the Universal Declaration of Human Rights and protected in the International Covenants of Human Rights are presented. The review of the content of rights aims at a more precise limitation of the field of research. The examination shows a diversity of rights which poses a serious challenge to the coherence of every philosophical theory of human rights. In the third chapter, central in the first part, international law is analyzed with regard to the characteristics of rights and the foundations of them. The analysis of documents shows a number of solutions referring to the anthropological foundations of rights. The inherent dignity of the human person is the source of all human rights. Each human being is recognized as free, and endowed with both reason and conscience. In the propounded conception of man individuals are not rivals but create a community which is a condition for their development. International law characterizes the rights as universal, inherent, inalienable and inviolable. The reconstructed conception also comprises the following basic elements: on the level of the structure of rights, a recognition of their equality, interdependence, and comprehensiveness; in the grounding of these rights, a recognition of the anthropological foundations of law; in the conception of positive law, a recognition of the secondariness of the positive law of human rights to human rights themselves, and a recognition of human rights and justice as the basis for legal order; in the conception of state, a recognition of the well-being of the individual as the fundamental aim of actions undertaken by political institutions, and recogni¬tion of rights which form an impassable boundary to the power of the state, includ¬ing its legislative actions. The characterization of the international legal paradigm serving for the under¬standing of human rights is supplemented by analyses of the structure of their posi¬tive legal protection. Various meanings of the terms "right" and "freedom" are distinguished. Subjective right, as basic structure of the positive legal protection of human rights, is understood as a complex relation formed by various legal situations of the subject of a right which create a functional whole in respect of the subordi-nation of human person to its good. Subordinating person to a good proper for it, expressed usually in a proclamatory norm, is the central element of particular rights around which further elements aiming at the realization of this good are built. In the second part of the book a philosophical theory is developed which allows for the location of a coherent foundation for the presented characterization of human rights and their positive legal protection. This part consists of two chapters. The first includes a review of some - not entirely satisfactory - means of founding of human rights; the second presents philosophical conceptions of law and man which may form a basis for the constructed theory. The review of arguments contained in the first chapter does not aim at a detailed analysis of various specific ways of argumentation encountered in works on this subject but rather at a concise presentation of the main possible lines of argumentation. These analyses also serve to emphasize the positive solutions which are pro¬posed later and to underscore the explanatory power of the elaborated theory. This theory, retaining accurate intuitions contained in the presented types of argumenta¬tion, helps in avoiding their consequences which are difficult to reconcile with the reconstructed paradigm of human rights. Efforts to base human rights on the norms of international law rightly take into account the necessity of determining the content of the rights and their positive legal protection as a means for the realization of man's good. These attempts, how¬ever, do not properly take into account the inherent character of human rights, which are independent of positive law and provide grounds for applying specific legislative measures and not others. Founding human rights on freedom accurately points at the freedom of an indi¬vidual as a constitutive element of some rights; however, absolutization of freedom leads, to a loss of an important element of the contemporary paradigm of under¬standing human rights. This foundation undermines recognition of the fact that human rights may set limits to both the freedom of others and the freedom of the subject of rights itself. Additionally, attempts at the so-called axiological justification of human rights are discussed. This type of justification has a few variants depending on the as¬sumed conception of value. Subjectivistic conceptions have similar advantages and disadvantages to the conceptions basing human rights on freedom; objectivistic conceptions while providing for the universality of human rights place, the fundamental aim of human rights protection beyond the individual human being - in the idealistically existing world of values; finally, conceptions rooting values and human rights in culture, while accurately noting that human rights are learned through the medium of culture, place the source of human rights beyond a concrete individual - in culture and processes which take place in it - which leads to difficulties in finding a basis for the universality of rights. Furthermore, attempts to ground human rights in specific characteristics of the human being are presented. This type of approach points to an important problem of dependence of the content of rights on what man is. However, recognition of specific characteristics of a human being as an ontic foundation of the existence of rights poses a danger to their universality since one has to accept that it is not enough to be a man to be a subject of rights, but a man possessing specific charac¬teristics. The second chapter aims at outlining solutions worked out by Saint Thomas Aquinas. For a fuller understanding of his propositions selected elements of Plato's and Aristotle's philosophy are presented. It was them who formulated the founda¬tions for reflection on law and justice in the ontological context. A qualification is made that Stoicism is not be analysed in depth. Although Thomas' concept of law was undoubtedly developed under the influence of the Stoic doctrine as well, it is not in this that one should look for the tools to understand the ontic foundations of human rights and law in general since the Stoic moral philosophy and philosophy of law were developed in the context of a theory of being which assumed monistic and pantheistic premises as foundations, leading to the recognition of a total subor¬dination of the human individual to a larger unity of which man is only a part. The analysis of Plato's and Aristotle's texts concentrates on problems of justice. Plato seems to be the first philosopher who reflected on the formula basic in the history of European thought: to render to each his due. It appears that justice as both a characteristic of man and his acts is understood in the perspective of that which is just, that which is a good for another man - the recipient of the act. The basis for determining what is just is the relation of correspondence between some¬one and something. While in the case of Plato this relation is based on something beyond its terms, namely on ideas, in the case of Aristotle the relation occurs on account of the elements of the relation itself. Something is just when it contributes to the develop¬ment of the recipient of an act realizing that which is just. At the same time, the realization of that which is just is a good for the agent. In the analysis of the just two types of relation are revealed: the relation of due-to-recipient occurring on account of the compatibility of that which is due, with the recipient of the act; and - a "superstructure" - a relation of obligation-of-subject occurring on account of the compatibility of the acting subject with the thing which should be done. The basis for being that which is due is formed by various potentialities of development of man - the recipient of agency; the basis of being that which is an obligation is the possibility of development of the subject of action. Aristotle distinguishes various types of freedom and points to the necessity of taking them into account in the discussion of justice. Among other things, as the core of man's freedom, he considers life for its own sake, which can be seen as his expression of the basic indices of the autotelic character of man - which is funda¬mental for later conceptions of dignity. The freedom which is described by him is not, however, inherent and inalienable; being free is conditioned by a factual possi¬bility of undertaking actions, which are not solely means to the realization of aims set by others. Thomas Aquinas takes over the Aristotelian research perspective both in his conception of man and of law. At the same time, however, he significantly enriches it. In anthropology he develops a conception of personal being. Drawing upon his distinction between existence ("that something is") and essence ("what something is"), he sees the basis for being a person in the dignity of personal being which is a certain way of existence of a rational being more perfect than that of non-personal beings. The person is a being which, by virtue of its act of existence, is individual¬ized in a specific way. It is an aim in itself. Expressing it in a negative way, one may say that it does not exist as a means for the realization of the aims of others and, in this sense, that it is free. As distinct from Aristotelian conclusions, being a person is not conditioned by the specific actions of a being. Dignity is inherent, based on that which is the foundation of the factual existence of every rational being. Although freedom requires that a being is rational, dignity still encompasses all being, all its properties and potentialities. Thus an act conforming with dignity has to take into account a whole human being. Among different types of that which is just, ius, the first place, from the point of view of understanding law, falls to "the just thing itself ("ipsa res justa"), which is right in the full meaning of the word. On the one hand, it is that which is due; on the other hand, it determines the way of acting in the utmost degree, since the course of every act is determined in the fullest extent by its aim. The content of ius may be determined both by elements independent of free decisions - ius naturale - and by free decisions taking into account the state of things - ius positivum. Recognition of the objective structure of being as the basis of law does not entail that it is possible or desirable to determine unequivocally "the only right" patterns of conduct. This concept is very well justified within the system proposed by Saint Thomas. Individualization of being is a significant element of the develop¬ment of a person as a person. It is attained by the realization of individual aims which are not unequivocally determined by circumstances and the nature common to all people. By virtue of free choices made in the sphere of that which is not by its nature unjust, the object of action becomes ius. Since in the realization of the person the individualization of human being is central, Aquinas clearly sees the need for the protection of the sphere of "dominion of will". This sphere itself constitutes ius naturale, something which is due to man independently of the acts of will. Therefore "law should forbid nothing which is not unjust" ("nihil debet lege prohiberi quod licite fieri potest", In 3 Sent., dist. 40, q. I, a. 1, 3). Besides the relation of due-to-recipient, ius also includes the relation of obligation-of-subject which is superimposed on the relation of due-to-recipient. As far as the ontic foundations of obligation are concerned, in explaining why man is subordinated to realization of the good of others, Aquinas generally follows Aristotle in accepting that this basis is the subordination to moral good - to actions conforming with the learned truth about reality. Aquinas' systemic solutions allow, however, to reach deeper and understand why moral development is also a development of the whole human being. This was difficult within Aristotle's system, since he was reluc¬tant to decide whether precedence should be given to intellectual or moral develop¬ment. The inclination to realise good of another appears to be a transcendental characteristic of being, based on its very existence. Morality understood as rational and free subordination to realize the good of another is a specifically personal way of the realization of this inclination. Thus just actions contribute to the actualization of being in the aspect of its existence and therefore to the actualization of being as a whole. Thomas' conception of natural law (lex naturalis) as participation in eternal law (lex aeterna), offers possibilities for grasping that which is just as something which is basically accessible cognition, independently of Revelation and independently of faith in God, and at the same time as something based in eternal law, understood as a design of God's wisdom. Eternal law, embracing all particular actions, is not, from the human perspective, accessible cognition directly. It is enacted in the struc-ture of the created being and - in case of human beings - in free choices taking this structure into account. In the concluding remarks, the results obtained earlier are applied directly to the contemporary conception of human rights. Human rights are understood in the first place as "just things" - concrete goods of man; as that which is due because of subordination, based on dignity, to the personal development of man. That which is just is understood as a relational - actual or potential - state of things, which exists by virtue of existing relations. Evaluations referring to that which is right are true when respective relations of due-to-recipient take place; norms of conduct are true when respective relations of obligation-of-subject take place. Examples of the application of the sketched theory outside the field of human rights are also presented. Procedural consequences of the developed theory are shown, such as the discrimination of two types of legislative procedures which differ significantly in the structure of argumentation: the first aims at recognition of that which is just independently of the will of the legislator, and the second, at making individual or collective "projects" of development compatible. Finally the possibilities of applying the theory to the increasingly important problems of the protection of the environment and the "rights" of animals are mentioned. The central issue is a philosophical conception of man and his freedom and a conception of law. It is also indispensable to turn to a general theory of being. The search for a comprehensive theory of human rights requires attention to the Abso¬lute Being - God - as well. This is important for at least two reasons. First, a conception of the Absolute Being is integral to philosophy of the systemic type -of which the present book is a piece. A conception of the Absolute Being is signifi¬cant for understanding all being, including, first of all, man as a personal being. Second, every theory of human rights which does not comprise the problem of the Absolute may be questioned as to whether solutions adopted in it do not lead, in consequence, to eliminating God from the perspective of the understanding of law. It is desirable that a philosophical theory should deal with this problem directly. A theory which eliminates God from the perspective of the understanding of rights will be unacceptable for all those who, for philosophical reasons or relying on faith, consider God as the author of inherent rights. Nevertheless, a theoretical approach to rights from the perspective of the Absolute Being should only be a possible extension of a philosophical approach which bases rights on something which is cognizable independently of the acceptance of the existence of God so that the theory is also acceptable for those who reject the existence of God or suspend their judgment on this subject. The pursued theory should therefore contain, on the one hand, reference to natural, faith-independent foundations of human rights, but on the other hand, point to a possible extension accounting for the Absolute Being. The analyses contained in this chapter have undoubtedly some historical value since they are based on source texts. Nevertheless, the use of these texts and not critical works was dictated, first of all, by a conviction that analyses embrace a given theory in the aspect selected by the interests of the researcher. Therefore to find out what past thinkers say on the subject characterized in the first part it is simpler to reach to the sources than to adopt the existing critical works. The pre¬sented reconstruction of Aquinas' views on philosophy of law incorporates proposi¬tions of supplementing and developing some of the ideas undertaken by him. Obligation to act in this and not an other way arises because human actions are subordinated to the conformity, on the one hand, of aims realized by these actions and, on the one hand, the order of being determining that which is favourable to man or destroys him. The content of the order of being is, on the one hand, determined by the structure of being independent from man's will and, on the other, by free decisions of man. (shrink)

This study aimed to identify the effect of procedural justice on organizational loyalty from the point of view of Faculty Staff at Palestine Technical University- Kadoorei. It also aimed to identify the differences in the views of the study sample on the study variables according to the years of service. In order to achieve this, the researchers used a questionnaire consisting of (22) paragraphs where the first area (10) paragraphs looking at procedural justice while the paragraphs of the second area (...) and the number of (12) paragraph in the field of organizational allegiance to Faculty Staff at the university, (105) questionnaires were distributed on the sample of the study, and after the process of distribution of the questionnaire was collected and coded and entered into the computer and processed statistically using the statistical program of social sciences (SPSS). One of the most important findings of the study was that the degree of procedural justice at the heads of departments at Palestine Technical University- Kadoorei, from the point of view of Faculty Staff was between the medium and large, where the average arithmetic (3.65). Respondents also showed a high level of organizational loyalty (3.84). The study also showed a statistically significant effect at the level of significance (α = 0.05) for procedural fairness in achieving organizational loyalty, and the absence of differences attributed to years of experience. In the light of the results of the previous study, the researchers recommended several recommendations, the most important of which is to increase the awareness of the workers on the principles of procedural justice, to encourage adherence to them and to indicate their importance in job performance by creating systems and methods that ensure commitment to justice by raising the ability of leaders to build new policies and visions Which would promote the work of institutions. (shrink)

It is here proposed an analysis of symbolic and sub-symbolic models for studying cognitive processes, centered on emergence and logical openness notions. The Theory of logical openness connects the Physics of system/environment relationships to the system informational structure. In this theory, cognitive models can be ordered according to a hierarchy of complexity depending on their logical openness degree, and their descriptive limits are correlated to Gödel-Turing Theorems on formal systems. The symbolic models with low logical openness describe cognition by (...) means of semantics which fix the system/environment relationship, while the sub-symbolic ones with high logical openness tends to seize its evolutive dynamics. An observer is defined as a system with high logical openness. In conclusion, the characteristic processes of intrinsic emergence typical of “bio-logic” - emerging of new codes-require an alternative model to Turing- computation, the natural or bio-morphic computation, whose essential features we are going here to outline. (shrink)

Objective: The objective of this study was to evaluate the clinical efficacy and appropriateness of colistin therapy in patients with hematological malignancies. -/- Methods: Age, gender, type of hematologic malignancy, and potential carbapenem-resistant microorganism risk factors were all noted in this retrospective study. In empirical and agent-specific treatment groups, differences in demographic features, risk factors, treatment responses, and side effects were compared. -/- Results: Sixty-three patients were included, 54% were male, and the median age was 49. In the last three (...) months, the hospitalization rate history was 68%, and four patients had a hospitalization history in the ICU. Carbapenem-resistant K. pneumoniae colonization was present in 22 patients (35%). Gram-negative microorganisms were isolated in 34 patients (54%). The carbapenem, quinolone, and colistin resistance rates were 82%, 76%, and 4% respectively. Clinical and microbiological response rates were 60% and 69%. 7 and 28-day mortality rates were 17% and 35%. There was no significant difference in demographic data and comorbidities in empirical (n=48) and agent-specific (n=15) treatment groups. The rate of carbapenem and glycopeptide treatments before colistin was higher in the empirical treatment group (p = 0.004; p = 0.001). The rate of starting combined antibiotics was higher in the empirical treatment group (p = 0.016). Two of the patients developed renal failure in the first week after treatment. -/- Conclusion: The use of empirical colistin may be unavoidable given the risk considerations. Shortly, colistin-resistant strains may also be a factor affecting treatment success negatively. (shrink)

In the 70 years since Alan Turing’s ‘Computing Machinery and Intelligence’ appeared in Mind, there have been two widely-accepted interpretations of the Turing test: the canonical behaviourist interpretation and the rival inductive or epistemic interpretation. These readings are based on Turing’s Mind paper; few seem aware that Turing described two other versions of the imitation game. I have argued that both readings are inconsistent with Turing’s 1948 and 1952 statements about intelligence, and fail to explain (...) the design of his game. I argue instead for a response-dependence interpretation. This interpretation has implications for Turing’s view of free will: I argue that Turing’s writings suggest a new form of free will compatibilism, which I call response-dependence compatibilism. The philosophical implications of rethinking Turing’s test go yet further. It is assumed by numerous theorists that Turing anticipated the computational theory of mind. On the contrary, I argue, his remarks on intelligence and free will lead to a new objection to computationalism. (shrink)

Since the beginning of the twenty-first century there has been an increasing awareness that software rep- resents a blind spot in new media theory. The growing interest in software also influences the argument in this paper, which sets out from the assumption that Alan M. Turing's concept of the universal machine, the first theoretical description of a computer program, is a kind of bachelor machine. Previous writings based on a similar hypothesis have focused either on a comparison of the (...) universal machine and the bachelor machine in terms of the similarities of their structural features, or they have taken the bachelor machine as a metaphor for a man or a computer. Unlike them, this paper stresses the importance of the con- text as a key to interpreting the universal Turing machine as a bachelor machine and, potentially, as a self-portrait. (shrink)

An Evaluation of the 2008 Loebner Contest.

This volume celebrates the various facets of Alan Turing (1912–1954), the British mathematician and computing pioneer, widely considered as the father of computer science. It is aimed at the general reader, with additional notes and references for those who wish to explore the life and work of Turing more deeply. -/- The book is divided into eight parts, covering different aspects of Turing’s life and work. -/- Part I presents various biographical aspects of Turing, some from (...) a personal point of view. -/- Part II presents Turing’s universal machine (now known as a Turing machine), which provides a theoretical framework for reasoning about computation. His 1936 paper on this subject is widely seen as providing the starting point for the field of theoretical computer science. -/- Part III presents Turing’s working on codebreaking during World War II. While the War was a disastrous interlude for many, for Turing it provided a nationally important outlet for his creative genius. It is not an overstatement to say that without Turing, the War would probably have lasted longer, and may even have been lost by the Allies. The sensitive nature of Turning’s wartime work meant that much of this has been revealed only relatively recently. -/- Part IV presents Turing’s post-War work on computing, both at the National Physical Laboratory and at the University of Manchester. He made contributions to both hardware design, through the ACE computer at the NPL, and software, especially at Manchester. Part V covers Turing’s contribution to machine intelligence (now known as Artificial Intelligence or AI). Although Turing did not coin the term, he can be considered a founder of this field which is still active today, authoring a seminal paper in 1950. -/- Part VI covers morphogenesis, Turing’s last major scientific contribution, on the generation of seemingly random patterns in biology and on the mathematics behind such patterns. Interest in this area has increased rapidly in recent times in the field of bioinformatics, with Turing’s 1952 paper on this subject being frequently cited. -/- Part VII presents some of Turing’s mathematical influences and achievements. Turing was remarkably free of external influences, with few co-authors – Max Newman was an exception and acted as a mathematical mentor in both Cambridge and Manchester. -/- Part VIII considers Turing in a wider context, including his influence and legacy to science and in the public consciousness. -/- Reflecting Turing’s wide influence, the book includes contributions by authors from a wide variety of backgrounds. Contemporaries provide reminiscences, while there are perspectives by philosophers, mathematicians, computer scientists, historians of science, and museum curators. Some of the contributors gave presentations at Turing Centenary meetings in 2012 in Bletchley Park, King’s College Cambridge, and Oxford University, and several of the chapters in this volume are based on those presentations – some through transcription of the original talks, especially for Turing’s contemporaries, now aged in their 90s. Sadly, some contributors died before the publication of this book, hence its dedication to them. -/- For those interested in personal recollections, Chapters 2, 3, 11, 12, 16, 17, and 36 will be of interest. For philosophical aspects of Turing’s work, see Chapters 6, 7, 26–31, and 41. Mathematical perspectives can be found in Chapters 35 and 37–39. Historical perspectives can be found in Chapters 4, 8, 9, 10, 13–15, 18, 19, 21–25, 34, and 40. With respect to Turing’s body of work, the treatment in Parts II–VI is broadly chronological. We have attempted to be comprehensive with respect to all the important aspects of Turing’s achievements, and the book can be read cover to cover, or the chapters can be tackled individually if desired. There are cross-references between chapters where appropriate, and some chapters will inevitably overlap. -/- We hope that you enjoy this volume as part of your library and that you will dip into it whenever you wish to enter the multifaceted world of Alan Turing. (shrink)

The paper explores the idea that some singular judgements about the natural numbers are immune to error through misidentification by pursuing a comparison between arithmetic judgements and first-person judgements. By doing so, the first part of the paper offers a conciliatory resolution of the Coliva-Pryor dispute about so-called “de re” and “which-object” misidentification. The second part of the paper draws some lessons about what it takes to explain immunity to error through misidentification. The lessons are: First, the so-called Simple (...) Account of which-object immunity to error through misidentification to the effect that a judgement is immune to this kind of error just in case its grounds do not feature any identification component fails. Secondly, wh-immunity can be explained by a Reference-Fixing Account to the effect that a judgement is immune to this kind of error just in case its grounds are constituted by the facts whereby the reference of the concept of the object which the judgement concerns is fixed. Thirdly, a suitable revision of the Simple Account explains the de re immunity of those arithmetic judgements which are not wh-immune. These three lessons point towards the general conclusion that there is no unifying explanation of de re and wh-immunity. (shrink)

Proceedings of the papers presented at the Symposium on "Revisiting Turing and his Test: Comprehensiveness, Qualia, and the Real World" at the 2012 AISB and IACAP Symposium that was held in the Turing year 2012, 2–6 July at the University of Birmingham, UK. Ten papers. - http://www.pt-ai.org/turing-test --- Daniel Devatman Hromada: From Taxonomy of Turing Test-Consistent Scenarios Towards Attribution of Legal Status to Meta-modular Artificial Autonomous Agents - Michael Zillich: My Robot is Smarter than Your Robot: (...) On the Need for a Total Turing Test for Robots - Adam Linson, Chris Dobbyn and Robin Laney: Interactive Intelligence: Behaviour-based AI, Musical HCI and the Turing Test - Javier Insa, Jose Hernandez-Orallo, Sergio España - David Dowe and M.Victoria Hernandez-Lloreda: The anYnt Project Intelligence Test (Demo) - Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill Hibbard: Turing Machines and Recursive Turing Tests — Francesco Bianchini and Domenica Bruni: What Language for Turing Test in the Age of Qualia? - Paul Schweizer: Could there be a Turing Test for Qualia? - Antonio Chella and Riccardo Manzotti: Jazz and Machine Consciousness: Towards a New Turing Test - William York and Jerry Swan: Taking Turing Seriously (But Not Literally) - Hajo Greif: Laws of Form and the Force of Function: Variations on the Turing Test. (shrink)

This article offers comprehensive criticism of the Turing test and develops quality criteria for new artificial general intelligence (AGI) assessment tests. It is shown that the prerequisites A. Turing drew upon when reducing personality and human consciousness to “suitable branches of thought” re-flected the engineering level of his time. In fact, the Turing “imitation game” employed only symbolic communication and ignored the physical world. This paper suggests that by restricting thinking ability to symbolic systems alone Turing (...) unknowingly constructed “the wall” that excludes any possi-bility of transition from a complex observable phenomenon to an abstract image or concept. It is, therefore, sensible to factor in new requirements for AI (artificial intelligence) maturity assessment when approaching the Tu-ring test. Such AI must support all forms of communication with a human being, and it should be able to comprehend abstract images and specify con-cepts as well as participate in social practices. (shrink)

This is a Turing Machine which computes the exponential function f(x,y) = xˆy. Instructions format and operation of this machine are intended to best reflect the basic conditions outlined by Alan Turing in his On Computable Numbers, with an Application to the Entscheidungsproblem (1936), using the simplest single-tape and single-symbol version, in essence due to Kleene (1952) and Carnielli & Epstein (2008). This machine is composed by four basic task machines: one which checks if exponent y is zero, (...) a second which checks if base x is zero, a third that is able to copy the base, and a fourth able to multiply multiple factors (in this case, factors will be all equal). They were conveniently separated in order to ease the reader's task to understand each step of its operation. We adopt the convention that a number n is represented by a string of n+1 symbols "1". Thus, an entry (x, y) will be represented by two respective strings of x+1 and y+1 symbols "1", separated by a single "0" (or a blank), and as an output, this machine will generate a string of (xˆy)+1 symbols "1". Some of the instructions are followed by a brief description of what's going on. (shrink)

In this article, I outline the three main philosophical lessons that we may learn from Turing’s work, and how they lead to a new philosophy of information. After a brief introduction, I discuss his work on the method of levels of abstraction (LoA), and his insistence that questions could be meaningfully asked only by specifying the correct LoA. I then look at his second lesson, about the sort of philosophical questions that seem to be most pressing today. Finally, I (...) focus on the third lesson, concerning the new philosophical anthropology that owes so much to Turing’s work. I then show how the lessons are learned by the philosophy of information. In the conclusion, I draw a general synthesis of the points made, in view of the development of the philosophy of information itself as a continuation of Turing’s work. (shrink)

Following Post program, we will propose a linguistic and empirical interpretation of Gödel’s incompleteness theorem and related ones on unsolvability by Church and Turing. All these theorems use the diagonal argument by Cantor in order to find limitations in finitary systems, as human language, which can make “infinite use of finite means”. The linguistic version of the incompleteness theorem says that every Turing complete language is Gödel incomplete. We conclude that the incompleteness and unsolvability theorems find limitations in (...) our finitary tool, which is our complete language. (shrink)

Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the reduction is unexplanatory. In (...) defense of this claim, I offer evidence from mathematical practice, and I respond to contrary suggestions due to Steinhart, Maddy, Kitcher and Quine. I then show how, even if set-theoretic reductions are generally not explanatory, set theory can nevertheless serve as a legitimate foundation for mathematics. Finally, some implications of my thesis for philosophy of mathematics and philosophy of science are discussed. In particular, I suggest that some reductions in mathematics are probably explanatory, and I propose that differing standards of theory acceptance might account for the apparent lack of unexplanatory reductions in the empirical sciences. (shrink)

Why are we so many? Or, in other words, Why is our species so successful? The ultimate cause of our success as species is that we, Homo sapiens, are the first and the only Turing complete species. Turing completeness is the capacity of some hardware to compute by software whatever hardware can compute. To reach the answer, I propose to see evolution and computing from the problem solving point of view. Then, solving more problems is evolutionarily better, computing (...) is for solving problems, and software is much cheaper than hardware, resulting that Turing completeness is evolutionarily disruptive. This conclusion, together with the fact that we are the only Turing complete species, is the reason that explains why we are so many. Most of our unique cognitive characteristics as humans can be derived from being Turing complete, as for example our complete language and our problem solving creativity. (shrink)

The Turing Test is one of the most disputed topics in artificial intelligence, philosophy of mind, and cognitive science. This paper is a review of the past 50 years of the Turing Test. Philosophical debates, practical developments and repercussions in related disciplines are all covered. We discuss Turing's ideas in detail and present the important comments that have been made on them. Within this context, behaviorism, consciousness, the 'other minds' problem, and similar topics in philosophy of mind (...) are discussed. We also cover the sociological and psychological aspects of the Turing Test. Finally, we look at the current situation and analyze programs that have been developed with the aim of passing the Turing Test. We conclude that the Turing Test has been, and will continue to be, an influential and controversial topic. -/- (This paper was reprinted in: The Turing Test: The Elusive Standard of Artificial Intelligence, J. H. Moor, ed., Kluwer Academic, pp. 23-78, 2003.). (shrink)

The Turing Test (TT), the Chinese Room Argument (CRA), and the Symbol Grounding Problem (SGP) are about the question “can machines think?” We propose to look at these approaches to Artificial Intelligence (AI) by showing that they all address the possibility for Artificial Agents (AAs) to generate meaningful information (meanings) as we humans do. The initial question about thinking machines is then reformulated into “can AAs generate meanings like humans do?” We correspondingly present the TT, the CRA and the (...) SGP as being about generation of human-like meanings. We model and address such possibility by using the Meaning Generator System (MGS) where a system submitted to an internal constraint generates a meaning in order to satisfy the constraint. The system approach of the MGS allows comparing meaning generations in animals, humans and AAs. The comparison shows that in order to have AAs capable of generating human-like meanings, we need the AAs to carry human constraints. And transferring human constraints to AAs raises concerns coming from the unknown natures of life and human mind which are at the root of human constraints. Implications for the TT, the CRA and the SGP are highlighted. It is shown that designing AAs capable of thinking like humans needs an understanding about the natures of life and human mind that we do not have today. Following an evolutionary approach, we propose as a first entry point an investigation about the possibility for extending a “stay alive” constraint into AAs. Ethical concerns are raised from the relations between human constraints and human values. Continuations are proposed. (This paper is an extended version of the proceedings of an AISB/IACAP 2012 presentation). (shrink)

Due to his significant role in the development of computer technology and the discipline of artificial intelligence, Alan Turing has supposedly subscribed to the theory of mind that has been greatly inspired by the power of the said technology which has eventually become the dominant framework for current researches in artificial intelligence and cognitive science, namely, computationalism or the computational theory of mind. In this essay, I challenge this supposition. In particular, I will try to show that there is (...) no evidence in Turing’s two seminal works that supports such a supposition. His 1936 paper is all about the notion of computation or computability as it applies to mathematical functions and not to the nature or workings of intelligence. On the other hand, while his 1950 work is about intelligence, it is, however, particularly concerned with the problem of whether intelligence can be attributed to computing machines and not of whether computationality can be attributed to human intelligence or to intelligence in general. (shrink)

This essay outlines a hierarchical framework of Reality that allows for degrees of Reality. I use Reality (with a capital “R”) to designate reality in a primitive, metaphysical sense. Reality, grounding, and essence are the key elements of the framework presented here. I assume that Reality must have a fundamental level and all fundamental phenomena must be Real. Moreover, I postulate that everything non-fundamental is ultimately grounded in the fundamental Real. But what about the Reality of the non-fundamental? I (...) argue that it is possible for non-fundamental phenomena to be Real, Unreal, or Semi-Real. The framework developed here accommodates these possibilities and illuminates them using the notion of essence. I argue that the essential nature of a phenomenon determines its degree of Reality. The framework does not assume that Reality must have degrees but only that it may have degrees. Its theoretical attractiveness consists in its ability to accommodate many diverse intuitions about grounding, help us better understand and classify theories about grounding, and illuminate Reality and its possible degrees. (shrink)

An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. Io finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.

Turing used the expression “emotional” in three distinct ways: to state his philosophical theory of the concept of intelligence, to classify arguments for and against the possibility of machine intelligence, and to describe the education of a “child machine”. The remarks on emotion include several of the most important philosophical claims. This paper analyses these remarks and their significance for current research in Artificial Intelligence.

On a literal reading of `Computing Machinery and Intelligence'', Alan Turing presented not one, but two, practical tests to replace the question `Can machines think?'' He presented them as equivalent. I show here that the first test described in that much-discussed paper is in fact not equivalent to the second one, which has since become known as `the Turing Test''. The two tests can yield different results; it is the first, neglected test that provides the more appropriate indication (...) of intelligence. This is because the features of intelligence upon which it relies are resourcefulness and a critical attitude to one''s habitual responses; thus the test''s applicablity is not restricted to any particular species, nor does it presume any particular capacities. This is more appropriate because the question under consideration is what would count as machine intelligence. The first test realizes a possibility that philosophers have overlooked: a test that uses a human''s linguistic performance in setting an empirical test of intelligence, but does not make behavioral similarity to that performance the criterion of intelligence. Consequently, the first test is immune to many of the philosophical criticisms on the basis of which the (so-called) `Turing Test'' has been dismissed. (shrink)

Is a human more conscious than an octopus? In the science of consciousness, it’s oftentimes assumed that some creatures (or mental states) are more conscious than others. But in recent years, a number of philosophers have argued that the notion of degrees of consciousness is conceptually confused. This paper (1) argues that the most prominent objections to degrees of consciousness are unsustainable, (2) examines the semantics of ‘more conscious than’ expressions, (3) develops an analysis of what it is (...) for a degreed property to count as degrees of consciousness, and (4) applies the analysis to various theories of consciousness. I argue that whether consciousness comes in degrees ultimately depends on which theory of consciousness turns out to be correct. But I also argue that most theories of consciousness entail that consciousness comes in degrees. (shrink)

SEMANTIC ARITHMETIC: A PREFACE John Corcoran Abstract Number theory, or pure arithmetic, concerns the natural numbers themselves, not the notation used, and in particular not the numerals. String theory, or pure syntax, concems the numerals as strings of «uninterpreted» characters without regard to the numbe~s they may be used to denote. Number theory is purely arithmetic; string theory is purely syntactical... in so far as the universe of discourse alone is considered. Semantic arithmetic is a broad (...) subject which begins when numerals are mentioned (not just used) and mentioned as names of numbers (not just as syntactic objects). Semantic arithmetic leads to many fascinating and surprising algorithms and decision procedures; it reveals in a vivid way the experiential import of mathematical propositions and the predictive power of mathematical knowledge; it provides an interesting perspective for philosophical, historical, and pedagogical studies of the growth of scientific knowledge and of the role metalinguistic discourse in scientific thought. (shrink)

Philosophical discussion of Alan Turing’s writings on intelligence has mostly revolved around a single point made in a paper published in the journal Mind in 1950. This is unfortunate, for Turing’s reflections on machine (artificial) intelligence, human intelligence, and the relation between them were more extensive and sophisticated. They are seen to be extremely well-considered and sound in retrospect. Recently, IBM developed a question-answering computer (Watson) that could compete against humans on the game show Jeopardy! There are hopes (...) it can be adapted to other contexts besides that game show, in the role of a collaborator of, rather than a competitor to, humans. Another, different, research project—an artificial intelligence program put into operation in 2010—is the machine learning program NELL (Never Ending Language Learning), which continuously ‘learns’ by ‘reading’ massive amounts of material on millions of web pages. Both of these recent endeavors in artificial intelligence rely to some extent on the integration of human guidance and feedback at various points in the machine’s learning process. In this paper, I examine Turing’s remarks on the development of intelligence used in various kinds of search, in light of the experience gained to date on these projects. (shrink)