Results for 'turing theory, computability, incompleteness, impossibility, limits of computation,'

1000+ found
Order:
  1. David Wolpert on Impossibility, Incompleteness, the Liar Paradox, the Limits of Computation, a Non-Quantum Mechanical Uncertainty Principle and the Universe as Computer—the Ultimate Theorem in Turing Machine Theory.Michael Starks - manuscript
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2.  47
    Wolpert, Chaitin and Wittgenstein on Impossibility, Incompleteness, the Liar Paradox, Theism, the Limits of Computation, a Non-Quantum Mechanical Uncertainty Principle and the Universe as Computer—the Ultimate Theorem in Turing Machine Theory (Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 294-299.
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3.  95
    Wolpert, Chaitin and Wittgenstein on Impossibility, Incompleteness, the Limits of Computation, Theism and the Universe as Computer-the Ultimate Turing Theorem.Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization Michael Starks 3rd Ed. (2017).
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p(2013).Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2017 3rd Ed 686p(2017).
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky 403(2013) from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  78
    Remarks on Wittgenstein, Gödel, Chaitin, Incompleteness, Impossiblity and the Psychological Basis of Science and Mathematics.Michael Richard Starks - 2019 - In Remarks on Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason in Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal. Las Vegas, NV USA: Reality Press. pp. 24-38.
    It is commonly thought that such topics as Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were resolved by Wittgenstein over 80 years ago. -/- Wittgenstein also demonstrated the fatal error in regarding mathematics or language or our behavior in general as a unitary coherent logical ‘system,’ rather than (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6.  43
    Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how language (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7.  21
    Wolpert, Chaitin y Wittgenstein sobre la imposibilidad, la incompletitud, la paradoja mentirosa, el teísmo, los límites de la computación, un principio de incertidumbre mecánica no cuántica y el universo como computadora, el teorema definitivo en la teoría de la máquina de Turing (revisado en 2019).Michael Richard Starks - 2019 - In Observaciones Sobre Imposibilidad, Incompleta, Paracoherencia,Indecisión,Aleatoriedad, Computabilidad, Paradoja E Incertidumbre En Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, Dacosta, Godel, Searle, Rodych, Berto,Floyd, Moyal-Sharrock Y Yanofsky. Las Vegas, NV USA: Reality Press. pp. 64-70.
    It is commonly thought that Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were mostly resolved by Wittgenstein over 80years ago. -/- “What we are ‘tempted to say’ in such a case is, of course, not philosophy, but it is its raw material. Thus, for example, what a mathematician (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8.  44
    Do Goedel's Incompleteness Theorems Set Absolute Limits on the Ability of the Brain to Express and Communicate Mental Concepts Verifiably?Bhupinder Singh Anand - 2004 - Neuroquantology 2:60-100.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  89
    Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  69
    Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic.Luis M. Augusto - 2018 - London: College Publications.
    This is the first of a two-volume work combining two fundamental components of contemporary computing into classical deductive computing, a powerful form of computation, highly adequate for programming and automated theorem proving, which, in turn, have fundamental applications in areas of high complexity and/or high security such as mathematical proof, software specification and verification, and expert systems. Deductive computation is concerned with truth-preservation: This is the essence of the satisfiability problem, or SAT, the central computational problem in computability and complexity (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. The Conceptual Impossibility of Free Will Error Theory.Andrew James Latham - 2019 - European Journal of Analytic Philosophy 15 (2):99-120.
    This paper argues for a view of free will that I will call the conceptual impossibility of the truth of free will error theory - the conceptual impossibility thesis. I will argue that given the concept of free will we in fact deploy, it is impossible for our free will judgements - judgements regarding whether some action is free or not - to be systematically false. Since we do judge many of our actions to be free, it follows from the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  13. Computability and Human Symbolic Output.Jason Megill & Tim Melvin - 2014 - Logic and Logical Philosophy 23 (4):391-401.
    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. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. Single-Tape and Multi-Tape Turing Machines Through the Lens of the Grossone Methodology.Yaroslav Sergeyev & Alfredo Garro - 2013 - Journal of Supercomputing 65 (2):645-663.
    The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Arnold Beckmann, Ulrich Berger, Benedikt Löwe & John V. Tucker (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Berlin: Springer. pp. 575--583.
    Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. The Semantic Theory of Truth: Field’s Incompleteness Objection.Glen A. Hoffmann - 2007 - Philosophia 35 (2):161-170.
    According to Field’s influential incompleteness objection, Tarski’s semantic theory of truth is unsatisfactory since the definition that forms its basis is incomplete in two distinct senses: (1) it is physicalistically inadequate, and for this reason, (2) it is conceptually deficient. In this paper, I defend the semantic theory of truth against the incompleteness objection by conceding (1) but rejecting (2). After arguing that Davidson and McDowell’s reply to the incompleteness objection fails to pass muster, I argue that, within the constraints (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17.  80
    How to Solve Moral Conundrums with Computability Theory.Jongmin Jerome Baek - 2018 - arXiv.
    Various moral conundrums plague population ethics: The Non-Identity Problem, The Procreation Asymmetry, The Repugnant Conclusion, and more. I argue that the aforementioned moral conundrums have a structure neatly accounted for, and solved by, some ideas in computability theory. I introduce a mathematical model based on computability theory and show how previous arguments pertaining to these conundrums fit into the model. This paper proceeds as follows. First, I do a very brief survey of the history of computability theory in moral philosophy. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18.  96
    The Neo‐Hegelian Theory of Freedom and the Limits of Emancipation.Brian O'Connor - 2015 - European Journal of Philosophy 23 (2):171-194.
    This paper critically evaluates what it identifies as ‘the institutional theory of freedom’ developed within recent neo-Hegelian philosophy. While acknowledging the gains made against the Kantian theory of autonomy as detachment it is argued that the institutional theory ultimately undermines the very meaning of practical agency. By tying agency to institutionally sustained recognition it effectively excludes the exercise of practical reason geared toward emancipation from a settled normative order. Adorno's notion of autonomy as resistance is enlisted to develop an account (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Systemism, Social Laws, and the Limits of Social Theory: Themes Out of Mario Bunge's: The Sociology-Philosophy Connection.Slava Sadovnikov - 2004 - Philosophy of the Social Sciences 34 (4):536-587.
    The four sections of this article are reactions to a few interconnected problems that Mario Bunge addresses in his The Sociology-Philosophy Connection , which can be seen as a continuation and summary of his two recent major volumes Finding Philosophy in Social Science and Social Science under Debate: A Philosophical Perspective . Bunge’s contribution to the philosophy of the social sciences has been sufficiently acclaimed. (See in particular two special issues of this journal dedicated to his social philosophy: "Systems and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20.  88
    The Theory of Computability Developed in Terms of Satisfaction.James Cain - 1999 - Notre Dame Journal of Formal Logic 40 (4):515-532.
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  21. Incompleteness and Computability. An Open Introduction to Gödel's Theorems.Richard Zach - 2019
    Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
    Download  
     
    Export citation  
     
    Bookmark  
  22. Emergence and Computation at the Edge of Classical and Quantum Systems.Ignazio Licata - 2008 - In World Scientific (ed.), Physics of Emergence and Organization. World Scientific.
    The problem of emergence in physical theories makes necessary to build a general theory of the relationships between the observed system and the observing system. It can be shown that there exists a correspondence between classical systems and computational dynamics according to the Shannon-Turing model. A classical system is an informational closed system with respect to the observer; this characterizes the emergent processes in classical physics as phenomenological emergence. In quantum systems, the analysis based on the computation theory fails. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  23.  28
    The Ontic Probability Interpretation of Quantum Theory - Part I: The Meaning of Einstein's Incompleteness Claim.Felix Alba-Juez - manuscript
    Ignited by Einstein and Bohr a century ago, the philosophical struggle about Reality is yet unfinished, with no signs of a swift resolution. Despite vast technological progress fueled by the iconic EPR paper (EPR), the intricate link between ontic and epistemic aspects of Quantum Theory (QT) has greatly hindered our grip on Reality and further progress in physical theory. Fallacies concealed by tortuous logical negations made EPR comprehension much harder than it could have been had Einstein written it himself in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Two Concepts of "Form" and the so-Called Computational Theory of Mind.John-Michael Kuczynski - 2006 - Philosophical Psychology 19 (6):795-821.
    According to the computational theory of mind , to think is to compute. But what is meant by the word 'compute'? The generally given answer is this: Every case of computing is a case of manipulating symbols, but not vice versa - a manipulation of symbols must be driven exclusively by the formal properties of those symbols if it is qualify as a computation. In this paper, I will present the following argument. Words like 'form' and 'formal' are ambiguous, as (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  25.  71
    The Impossibility of Quine’s Indeterminacy Theory.Duncan MacIntosh - 1988 - Philosophie Et Culture: Actes du XVIIe Congrès Mondial de Philosophie 3:22-26.
    Download  
     
    Export citation  
     
    Bookmark  
  26. Review of Hyperspace by Michio Kaku (1994).Starks Michael - 2016 - In Michael Starks (ed.), Suicidal Utopian Delusions in the 21st Century: Philosophy, Human Nature and the Collapse of Civilization-- Articles and Reviews 2006-2017 2nd Edition Feb 2018. Michael Starks. pp. 620-626.
    "There is something fascinating about science. One gets such wholesale returns of conjecture out of such a trifling investment of fact" Mark Twain-Life on the Mississippi -/- This is a lovely book full of fascinating info on the evolution of physics and cosmology. Its main theme is how the idea of higher dimensional geometry created by Riemann, recently extended to 24 dimensions by string theory, has revolutionized our understanding of the universe. Everyone knows that Riemann created multidimensional geometry in 1854 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27.  47
    What Do Paraconsistent, Undecidable, Random, Computable and Incomplete Mean? A Review of Godel's Way: Exploits Into an Undecidable World by Gregory Chaitin, Francisco A Doria, Newton C.A. Da Costa 160p (2012) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 278-293.
    In ‘Godel’s Way’ three eminent scientists discuss issues such as undecidability, incompleteness, randomness, computability and paraconsistency. I approach these issues from the Wittgensteinian viewpoint that there are two basic issues which have completely different solutions. There are the scientific or empirical issues, which are facts about the world that need to be investigated observationally and philosophical issues as to how language can be used intelligibly (which include certain questions in mathematics and logic), which need to be decided by looking at (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28.  10
    The Ontic Probability Interpretation of Quantum Theory - Part II: Einstein's Incompleteness/Nonlocality Dilemma.Felix Alba-Juez - manuscript
    After pinpointing a conceptual confusion (TCC), a Reality preconception (TRP1), and a fallacious dichotomy (TFD), the famous EPR/EPRB argument for correlated ‘particles’ is studied in the light of the Ontic Probability Interpretation (TOPI) of Quantum Theory (QT). Another Reality preconception (TRP2) is identified, showing that EPR used and ignored QT predictions in a single paralogism. Employing TFD and TRP2, EPR unveiled a contradiction veiled in its premises. By removing nonlocality from QT’s Ontology by fiat, EPR preordained its incompleteness. The Petitio (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29.  90
    Turing Machines and Semantic Symbol Processing: Why Real Computers Don’T Mind Chinese Emperors.Richard Yee - 1993 - Lyceum 5 (1):37-59.
    Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. Languages, Machines, and Classical Computation.Luis M. Augusto - 2019 - London, UK: College Publications.
    A circumscription of the classical theory of computation building up from the Chomsky hierarchy.
    Download  
     
    Export citation  
     
    Bookmark  
  31. Factoring Out the Impossibility of Logical Aggregation.Philippe Mongin - 2008 - Journal of Economic Theory 141:p. 100-113.
    According to a theorem recently proved in the theory of logical aggregation, any nonconstant social judgment function that satisfies independence of irrelevant alternatives (IIA) is dictatorial. We show that the strong and not very plausible IIA condition can be replaced with a minimal independence assumption plus a Pareto-like condition. This new version of the impossibility theorem likens it to Arrow’s and arguably enhances its paradoxical value.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   23 citations  
  32.  42
    The Changing Practices of Proof in Mathematics: Gilles Dowek: Computation, Proof, Machine. Cambridge: Cambridge University Press, 2015. Translation of Les Métamorphoses du Calcul, Paris: Le Pommier, 2007. Translation From the French by Pierre Guillot and Marion Roman, $124.00HB, $40.99PB.Andrew Arana - 2017 - Metascience 26 (1):131-135.
    Review of Dowek, Gilles, Computation, Proof, Machine, Cambridge University Press, Cambridge, 2015. Translation of Les Métamorphoses du calcul, Le Pommier, Paris, 2007. Translation from the French by Pierre Guillot and Marion Roman.
    Download  
     
    Export citation  
     
    Bookmark  
  33. On Interpreting Chaitin's Incompleteness Theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  34. The Theory of Judgment Aggregation: An Introductory Review.Christian List - 2012 - Synthese 187 (1):179-207.
    This paper provides an introductory review of the theory of judgment aggregation. It introduces the paradoxes of majority voting that originally motivated the field, explains several key results on the impossibility of propositionwise judgment aggregation, presents a pedagogical proof of one of those results, discusses escape routes from the impossibility and relates judgment aggregation to some other salient aggregation problems, such as preference aggregation, abstract aggregation and probability aggregation. The present illustrative rather than exhaustive review is intended to give readers (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  35. Is There Any Real Substance to the Claims for a 'New Computationalism'?Alberto Hernandez-Espinosa, Hernandez-Quiroz Francisco & Zenil Hector - forthcoming - In CiE Computability in Europe 2017. Springer Verlag.
    'Computationalism' is a relatively vague term used to describe attempts to apply Turing's model of computation to phenomena outside its original purview: in modelling the human mind, in physics, mathematics, etc. Early versions of computationalism faced strong objections from many (and varied) quarters, from philosophers to practitioners of the aforementioned disciplines. Here we will not address the fundamental question of whether computational models are appropriate for describing some or all of the wide range of processes that they have been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. The Present and Future of Judgement Aggregation Theory. A Law and Economics Perspective.Philippe Mongin - forthcoming - In Jean-François Laslier, Hervé Moulin, Remzi Sanver & William S. Zwicker (eds.), The Future of Economic Design. New York: Springer.
    This chapter briefly reviews the present state of judgment aggregation theory and tentatively suggests a future direction for that theory. In the review, we start by emphasizing the difference between the doctrinal paradox and the discursive dilemma, two idealized examples which classically serve to motivate the theory, and then proceed to reconstruct it as a brand of logical theory, unlike in some other interpretations, using a single impossibility theorem as a key to its technical development. In the prospective part, having (...)
    Download  
     
    Export citation  
     
    Bookmark  
  37.  57
    Only Human: A Book Review of The Turing Guide. [REVIEW]Bjørn Kjos-Hanssen - forthcoming - Notices of the American Mathematical Society 66 (4).
    This is a review of The Turing Guide (2017), written by Jack Copeland, Jonathan Bowen, Mark Sprevak, Robin Wilson, and others. The review includes a new sociological approach to the problem of computability in physics.
    Download  
     
    Export citation  
     
    Bookmark  
  38. Hayek's Epistemic Theory of Industrial Fluctuations.Scott Scheall - manuscript
    F.A. Hayek essentially quit economic theory and gave up the phenomena of industrial fluctuations as an explicit object of theoretical investigation following the publication of his last work in technical economics, 1941’s The Pure Theory of Capital. Nonetheless, several of Hayek’s more methodologically-oriented writings bear important implications for economic phenomena, especially those of industrial fluctuations. Decisions (usually, for Hayek, of a political nature) taken on the basis of a “pretence” of knowledge impede the operation of the price system’s belief-coordinating function (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  90
    Logical Openness in Cognitive Models.Prof Ignazio Licata - 2008 - Epistemologia:177-192.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. Philosophy and Theory of Artificial Intelligence.Vincent C. Müller (ed.) - 2013 - Springer.
    [Müller, Vincent C. (ed.), (2013), Philosophy and theory of artificial intelligence (SAPERE, 5; Berlin: Springer). 429 pp. ] --- Can we make machines that think and act like humans or other natural intelligent agents? The answer to this question depends on how we see ourselves and how we see the machines in question. Classical AI and cognitive science had claimed that cognition is computation, and can thus be reproduced on other computing machines, possibly surpassing the abilities of human intelligence. This (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  50
    Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
    The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.
    Download  
     
    Export citation  
     
    Bookmark  
  42. Relativity Theory May Not Have the Last Word on the Nature of Time: Quantum Theory and Probabilism.Nicholas Maxwell - 2017 - In G. Ghirardi & S. Wuppulur (eds.), Space, Time and the Limits of Human Understanding. Springer. pp. 109-124.
    Two radically different views about time are possible. According to the first, the universe is three dimensional. It has a past and a future, but that does not mean it is spread out in time as it is spread out in the three dimensions of space. This view requires that there is an unambiguous, absolute, cosmic-wide "now" at each instant. According to the second view about time, the universe is four dimensional. It is spread out in both space and time (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43.  40
    Remarques sur l'impossibilité l'incomplétude, la paracohérence l'indécision, le hasard, la calculabilité, le paradoxe et l'incertitude - dans Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria da Costa, Godel, Searle, Rodych, Berto Floyd, Moyal-Sharrock et Yanofsky.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    On pense généralement que l'impossibilité, l'incomplétdulité, la paracohérence, l'indécidabilité, le hasard, la calcul, le paradoxe, l'incertitude et les limites de la raison sont des questions scientifiques physiques ou mathématiques disparates ayant peu ou rien dans terrain d'entente. Je suggère qu'ils sont en grande partie des problèmes philosophiques standard (c.-à-d., jeux de langue) qui ont été la plupart du temps résolus par Wittgenstein plus de 80 ans. Je fournis un bref résumé de quelques-unes des principales conclusions de deux des plus éminents (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  44. Pernyataan tentang kemustahilan, ketidaklengkapan, Paraconsistency,Undecidability, Randomness, Komputabilitas, paradoks, dan ketidakpastian dalam Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal-Sharrock dan Yanofsky.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    Hal ini sering berpikir bahwa kemustahilan, ketidaklengkapan, Paraconsistency, Undecidability, Randomness, komputasi, Paradox, ketidakpastian dan batas alasan yang berbeda ilmiah fisik atau matematika masalah memiliki sedikit atau tidak ada dalam Umum. Saya menyarankan bahwa mereka sebagian besar masalah filosofis standar (yaitu, Permainan bahasa) yang sebagian besar diselesaikan oleh Wittgenstein lebih dari 80years yang lalu. -/- "Apa yang kita ' tergoda untuk mengatakan ' dalam kasus seperti ini, tentu saja, bukan filsafat, tetapi bahan baku. Jadi, misalnya, apa yang seorang matematikawan cenderung mengatakan (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  45. Cognitive Computation Sans Representation.Paul Schweizer - 2017 - In Thomas Powers (ed.), Philosophy and Computing: Essays in epistemology, philosophy of mind, logic, and ethics,. Cham, Switzerland: Springer. pp. 65-84.
    The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  46.  41
    A Formal Theory of Democratic Deliberation.Hun Chung & John Duggan - 2020 - American Political Science Review 114 (1):14-35.
    Inspired by impossibility theorems of social choice theory, many democratic theorists have argued that aggregative forms of democracy cannot lend full democratic justification for the collective decisions reached. Hence, democratic theorists have turned their attention to deliberative democracy, according to which “outcomes are democratically legitimate if and only if they could be the object of a free and reasoned agreement among equals” (Cohen 1997a, 73). However, relatively little work has been done to offer a formal theory of democratic deliberation. This (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47. Beyond Formal Structure: A Mechanistic Perspective on Computation and Implementation.Marcin Miłkowski - 2011 - Journal of Cognitive Science 12 (4):359-379.
    In this article, after presenting the basic idea of causal accounts of implementation and the problems they are supposed to solve, I sketch the model of computation preferred by Chalmers and argue that it is too limited to do full justice to computational theories in cognitive science. I also argue that it does not suffice to replace Chalmers’ favorite model with a better abstract model of computation; it is necessary to acknowledge the causal structure of physical computers that is not (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   9 citations  
  48.  22
    Reseña de ' Los Límites Exteriores de la Razón '(The Outer Limits of Reason) por Noson Yanofsky 403p (2013) (revision revisada 2019).Michael Richard Starks - 2019 - In Delirios Utópicos Suicidas en el Siglo 21 La filosofía, la naturaleza humana y el colapso de la civilización Artículos y reseñas 2006-2019 4a Edición. Las Vegas, NV USA: Reality Press. pp. 283-298.
    Doy una revisión detallada de ' los límites externos de la razón ' por Noson Yanofsky desde una perspectiva unificada de Wittgenstein y la psicología evolutiva. Yo indiqué que la dificultad con cuestiones como la paradoja en el lenguaje y las matemáticas, la incompletitud, la indeterminación, la computabilidad, el cerebro y el universo como ordenadores, etc., surgen de la falta de mirada cuidadosa a nuestro uso del lenguaje en el adecuado contexto y, por tanto, el Error al separar los problemas (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  49. Prospects for a Naive Theory of Classes.Hartry Field, Harvey Lederman & Tore Fjetland Øgaard - 2017 - Notre Dame Journal of Formal Logic 58 (4):461-506.
    The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identical. In (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  50. The Limits of Faultless Disagreement.Carl Baker - manuscript
    Some have argued that the possibility of faultless disagreement gives relativist semantic theories an important explanatory advantage over their absolutist and contextualist rivals. Here I combat this argument, focusing on the specific case of aesthetic discourse. My argument has two stages. First, I argue that while relativists may be able to account for the possibility of faultless aesthetic disagreement, they nevertheless face difficulty in accounting for the intuitive limits of faultless disagreement. Second, I develop a new non-relativist theory which (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000