Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.

Philosophy has been characterized (e.g., by Benson Mates) as a field whose problems are unsolvable. This has often been taken to mean that there can be no progress in philosophy as there is in mathematics or science. The nature of problems and solutions is considered, and it is argued that solutions are always parts of theories, hence that acceptance of a solution requires commitment to a theory (as suggested by William Perry's scheme of cognitive development). Progress can be had in (...) philosophy in the same way as in mathematics and science by knowing what commitments are needed for solutions. Similar views of Rescher and Castañeda are discussed. (shrink)

The invitation of the Organizing Committee for me to speak about “Unsolved problems in mathematics” fills me as it should with considerable trepidation and a prevailing feeling of personal inadequacy. Hilbert gave a talk on this subject at the similar congress about 50 years ago and this is a very formidable precedent. He stated about a dozen unsolved problems in another widely separated areas of mathematics, and they proved to be prototypical for much of the development that followed in the (...) next decades. It would be absolutely foolish, if I tried to emulate this quite singular feat. In addition I do not know the future and the future at any rate can only be predicted ex post with any degree of reliability. I will, therefore, define what I am trying to do in a much more narrow way, hoping that in this manner I have a better chance of not failing. I will limit myself to a particular area of mathematics which I think I know and I will talk about it and about what its open ends appear to be, particularly in some directions which are not the ones that the evolution so far has mainly emphasized and which are, I think, quite important. (shrink)

This paper identifies one way that a mathematical proof can be more explanatory than another proof. This is by invoking a more abstract kind of entity than the topic of the theorem. These abstract mathematical explanations are identified via an investigation of a canonical instance of modern mathematics: the Galois theory proof that there is no general solution in radicals for fifth-degree polynomial equations. I claim that abstract explanations are best seen as describing a special sort of dependence relation between (...) distinct mathematical domains. This case study highlights the importance of the conceptual, as opposed to computational, turn of much of modern mathematics, as recently emphasized by Tappenden and Avigad. The approach adopted here is contrasted with alternative proposals by Steiner and Kitcher. (shrink)

It has been suggested that certain problems may be unsolvable because of the mind's cognitive structure, but we may wonder what problems, and exactly why. The ultimate origin of the universe and the mind-body problem seem to be two such problems. As to why, Colin McGinn has argued that the mind-body problem is unsolvable because any theoretical concepts about the brain will be observation-based and unable to connect to unobservable subjective experience. McGinn's argument suggests a requirement of imagability -- an (...) observation basis -- for physical causal explanation that cannot be met for either of these problems. Acausal descriptions may be possible but not the causal analyses that provide the greatest explanatory satisfaction, a psychological phenomenon that seems tied to the strength of the underlying observation basis but is affected by other factors as well. (shrink)

I first seriously contemplated writing a book on degree theory in 1976 while I was visiting the University of Illinois at Chicago Circle. There was, at that time, some interest in ann-series book about degree theory, and through the encouragement of Bob Soare, I decided to make a proposal to write such a book. Degree theory had, at that time, matured to the point where the local structure results which had been the mainstay of the earlier papers in the area (...) were finding a steadily increasing number of applications to global degree theory. Michael Yates was the first to realize that the time had come for a systematic study of the interaction between local and global degree theory, and his papers had a considerable influence on the content of this book. During the time that the book was being written and rewritten, there was an explosion in the number of global theorems about the degrees which were proved as applications of local theorems. The global results, in turn, pointed the way to new local theorems which were needed in order to make further progress. I have tried to update the book continuously, in order to be able to present some of the more recent results. It is my hope to introduce the reader to some of the fascinat ing combinatorial methods of Recursion Theory while simultaneously showing how to use these methods to prove some beautiful global theorems about the degrees. (shrink)

According to Slote's ``agent-based'' virtue ethics, the rightness orwrongness of an act is determined by the motive it expresses. Thistheory has a problem with cases where an agent can do her duty onlyby expressing some vicious motive and thereby acting wrongly. In sucha situation, an agent can only act wrongly; hence, the theory seemsincompatible with the maxim that `ought' implies `can'. I argue thatSlote's attempt to circumvent this problem by appealing to compatibilism is inadequate. In a wide range of psychologically (...) realistic cases, an agent's effective choice will be between failingto do her duty and doing it from inferior motives. Then anythingshe can do will be wrong, according to the agent-based theory,contrary to the maxim Slote wishes to preserve. (shrink)

The following essay, “The Unsolved Issue of Consciousness” (Torinokosaretaru ishiki no mondai 取残されたる意識の問題), by Nishida Kitarō 西田幾多郎 from 1927 is significant in regard to the development of what has come to be called “Nishida philosophy” (Nishida tetsugaku 西田哲学). In what follows, in addition to providing some commentary on the important points of his essay, I would like to show its relevance or significance not only for those who would like to study Nishida’s thought but also for philosophy in general, especially (...) in the contemporary setting. It was first published in 1927 by Iwanami Publishers in a collection of essays by different authors, Philosophical Essays in Commemoration of the Sixtieth Birthday of Dr. .. (shrink)

S-Modulin is a frog homolog of recoverin. The function and the underlying mechanism of the action of these proteins are now understood in general. However, there remain some unsolved issues including; two distinct effects of S-modulin; Ca2+-dependent binding of S-modulin to membranes and a possible target protein; S-modulin-like proteins in other neurons. These issues are considered in this commentary.

The book complements standard course texts in cognition by providing a series of articles which emphasize particularly what we do not understand, rather than ...

The contributions in the book examine the historical and contemporary manifestations of organized crime, the symbiotic relationship between legitimate and ...

For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existence theorem for minimal degrees.

Philosophers and historians of the French Revolution have seen Rousseau's influence as the decisive link between the doctrines of the Enlightenment and the practice of its revolutionary disciples. Professor Leigh here addresses the bibliographical foundations of that question, without which all attempts to settle it in the past have lacked authority. Introducing the most advanced techniques to identify variant and pirate editions of Rousseau's writings, he establishes that there were at least 28 separate imprints and an additional 12 reprints of (...) the Contrat Social in collective editions between 1762 and 1783. Professor Leigh shows also that Rousseau's life and thought excited a fascination and interest in the last years of the Ancien Regime which was nursed by the publishers of his Oeuvres, who sought to satisfy an apparently ceaseless demand by extending their editions, while at the same time attempting to ward off both their creditors and their imitators. (shrink)

The uniform halting problem (UH) can be stated as follows:Give a decision procedure which for any given Turing machine (TM) will decide whether or not it has an immortal instantaneous description (ID).An ID is called immortal if it has no terminal successor. As it is generally the case in the literature (see e.g. Minsky [4, p. 118]) we assume that in an ID the tape must be blank except for some finite number of squares. If we remove this restriction the (...) UH becomes the immortality problem (IP). (shrink)

The mind-body problem is analyzed in a physicalist perspective. By combining the concepts of emergence and algorithmic information theory in a thought experiment employing a basic nonlinear process, it is argued that epistemically strongly emergent properties may develop in a physical system. A comparison with the significantly more complex neural network of the brain shows that also consciousness is epistemically emergent in a strong sense. Thus reductionist understanding of consciousness appears not possible; the mind-body problem does not have a reductionist (...) solution. The ontologically emergent character of consciousness is then identified from a combinatorial analysis relating to system limits set by quantum mechanics, implying that consciousness is fundamentally irreducible to low-level phenomena. In the perspective of a modified definition of free will, the character of the physical interactions of the brain's neural system is subsequently studied. As an ontologically open system, it is asserted that its future states are undeterminable in principle. We argue that this leads to freedom of the will. (shrink)

This essay by Nishida Kitarō from 1927, translated into English here for the first time, is from the initial period of what has come to be called “Nishida philosophy” (Nishida tetsugaku), when Nishida was first developing his conception of “place” (basho). Nishida here inquires into the relationship between logic and consciousness in terms of place and implacement in order to overcome the shortcomings of previous philosophical attempts—from the ancient Greeks to the moderns—to dualistically conceive the relationship between being and knowing (...) in terms of subject-object or form-matter. During the course of articulating his novel approach to consciousness and cognition, Nishida discusses what he takes to be the weaknesses of Greek hylomorphism, Kantian (and neo-Kantian) dualism, and Husserlian phenomenology. Dissatisfied with the attribution of mere passivity to placiality, and turning away from consciousness objectified as a subject of statement, Nishida imparts to consciousness qua place a certain logical independence as an active yet un-objectifiable “predicate.” This investigation of consciousness as the unobjectifiable place for objectification leads Nishida to the notion of what precedes consciousness itself, a “place of nothing” (mu no basho) that envelops the dichotomized structures of subject-predicate, being-nothing, subject-object, universal-particular, et cetera. (shrink)

This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...) potentialities of human thought, and, if not, there are absolutely unsolvable mathematical problems of diophantine form. (shrink)

The remainder set A⟂B of a set of sentences A modulo a set of sentences B is the set of all maximal subsets of A not implying any element of B. A remainder equation is an expression containing remainder sets, such as {A} = B⟂X, in which at least one set is unknown. Solutions to some classes of remainder equations are reported, and some unsolved problems are listed.

"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers (...) by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed. (shrink)

The tripartite account of propositional, fallibilist knowledge that p as justified true belief can become adequate only if it can solve the Gettier Problem. However, the latter can be solved only if the problem of a successful coordination of the resources (at least truth and justification) necessary and sufficient to deliver propositional, fallibilist knowledge that p can be solved. In this paper, the coordination problem is proved to be insolvable by showing that it is equivalent to the ''''coordinated attack'''' problem, (...) which is demonstrably insolvable in epistemic logic. It follows that the tripartite account is not merely inadequate as it stands, as proved by Gettier-type counterexamples, but demonstrably irreparable in principle, so that efforts to improve it can never succeed. (shrink)