This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

0 found
Order:
  1. A Contradiction and P=NP Problem.Farzad Didehvar -
    Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. Fuzzy Time, From Paradox to Paradox.Farzad Didehvar - manuscript
    Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to consider (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  3. 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 (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Randomness is Unpredictability.Jon Williamson - manuscript
  5. Evolutionary Scenarios for the Emergence of Recursion.Lluís Barceló-Coblijn - forthcoming - Theoria Et Historia Scientiarum 9:171-199.
    Remove from this list  
     
    Export citation  
     
    Bookmark   2 citations  
  6. Algorithmic Randomness and Measures of Complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Strengthening Weak Emergence.Nora Berenstain - forthcoming - Erkenntnis:1-18.
    Bedau's influential (1997) account analyzes weak emergence in terms of the non-derivability of a system’s macrostates from its microstates except by simulation. I offer an improved version of Bedau’s account of weak emergence in light of insights from information theory. Non-derivability alone does not guarantee that a system’s macrostates are weakly emergent. Rather, it is non-derivability plus the algorithmic compressibility of the system’s macrostates that makes them weakly emergent. I argue that the resulting information-theoretic picture provides a metaphysical account of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8. Computability: Gödel, Turing, Church, and Beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - forthcoming - MIT Press.
  9. Explaining Experience In Nature: The Foundations Of Logic And Apprehension.Steven Ericsson-Zenith - forthcoming - Institute for Advanced Science & Engineering.
    At its core this book is concerned with logic and computation with respect to the mathematical characterization of sentient biophysical structure and its behavior. -/- Three related theories are presented: The first of these provides an explanation of how sentient individuals come to be in the world. The second describes how these individuals operate. And the third proposes a method for reasoning about the behavior of individuals in groups. -/- These theories are based upon a new explanation of experience in (...)
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  10. Reviewed Work(S): Lowness Properties and Randomness. Advances in Mathematics, Vol. 197 by André Nies; Lowness for the Class of Schnorr Random Reals. SIAM Journal on Computing, Vol. 35 by Bjørn Kjos-Hanssen; André Nies; Frank Stephan; Lowness for Kurtz Randomness. The Journal of Symbolic Logic, Vol. 74 by Noam Greenberg; Joseph S. Miller; Randomness and Lowness Notions Via Open Covers. Annals of Pure and Applied Logic, Vol. 163 by Laurent Bienvenu; Joseph S. Miller; Relativizations of Randomness and Genericity Notions. The Bulletin of the London Mathematical Society, Vol. 43 by Johanna N. Y. Franklin; Frank Stephan; Liang Yu; Randomness Notions and Partial Relativization. Israel Journal of Mathematics, Vol. 191 by George Barmpalias; Joseph S. Miller; André Nies. [REVIEW]Johanna N. Y. Franklin - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    Review by: Johanna N. Y. Franklin The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 115-118, March 2013.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  11. Computability as a Physical Modality.Tamara Horowitz - forthcoming - Unpublished Ms Held in the Casimir Lewy Library, Cambridge.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. Expression de la Recursion Primitive Dans le Calcul-XK.J. Ladriere - forthcoming - Logique Et Analyse.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  13. Conference on Computability, Complexity and Randomness: Isaac Newton Institute, Cambridge, Uk July 2-6, 2012.Elvira Mayordomo & Wolfgang Merkle - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    Elvira Mayordomo and Wolfgang Merkle The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 135-136, March 2013.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  14. Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
    Infinite time Turing machines represent a model of computability that extends the operations of Turing machines to transfinite ordinal time by defining the content of each cell at limit steps to be the lim sup of the sequences of previous contents of that cell. In this paper, we study a computational model obtained by replacing the lim sup rule with an ‘eventually constant’ rule: at each limit step, the value of each cell is defined if and only if the content (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  15. A Minimal Pair in the Generic Degrees.Denis R. Hirschfeldt - 2020 - Journal of Symbolic Logic 85 (1):531-537.
    We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. Pincherle's Theorem in Reverse Mathematics and Computability Theory.Dag Normann & Sam Sanders - 2020 - Annals of Pure and Applied Logic 171 (5):102788.
    We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) compactness, but we nonetheless exhibit fundamental differences between compactness and Pincherle's theorem. For instance, the main question of Reverse Mathematics, namely which set existence axioms are necessary to (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17. Hilbert's 10th Problem for Solutions in a Subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.
    Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  18. 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 works. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  19. Wolpert, Chaitin e Wittgenstein em impossibilidade, incompletude, o paradoxo do mentiroso, o teísmo, os limites da computação, um princípio de incerteza mecânica não quântica e o universo como computador — o teorema final na teoria da máquina de Turing (revisado 2019).Michael Richard Starks - 2019 - In Delírios Utópicos Suicidas no Século XXI Filosofia, Natureza Humana e o Colapso da Civilization- Artigos e Comentários 2006-2019 5ª edição. Las Vegas, NV USA: Reality Press. pp. 183-187.
    Eu li muitas discussões recentes sobre os limites da computação e do universo como computador, na esperança de encontrar alguns comentários sobre o trabalho surpreendente do físico polimatemático e teórico da decisão David Wolpert, mas não encontrei uma única citação e assim que eu apresento este muito breve Resumo. Wolpert provou alguma impossibilidade impressionante ou teoremas da incompletude (1992 a 2008-Veja arxiv dot org) nos limites à inferência (computação) que são tão gerais que são independentes do dispositivo que faz a (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  20. 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 (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  21. On the Question of Whether the Mind Can Be Mechanized, I: From Gödel to Penrose.Peter Koellner - 2018 - Journal of Philosophy 115 (7):337-360.
    In this paper I address the question of whether the incompleteness theorems imply that “the mind cannot be mechanized,” where this is understood in the specific sense that “the mathematical outputs of the idealized human mind do not coincide with the mathematical outputs of any idealized finite machine.” Gödel argued that his incompleteness theorems implied a weaker, disjunctive conclusion to the effect that either “the mind cannot be mechanized” or “mathematical truth outstrips the idealized human mind.” Others, most notably, Lucas (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  22. 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.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23. Computable Axiomatizability of Elementary Classes.Peter Sinclair - 2016 - Mathematical Logic Quarterly 62 (1-2):46-51.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  24. Predicatively Computable Functions on Sets.Toshiyasu Arai - 2015 - Archive for Mathematical Logic 54 (3-4):471-485.
    Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable set functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25. Review of Computability: Turing, Gödel, Church, and Beyond. [REVIEW]Andrew Arana - 2015 - Notre Dame Philosophical Reviews 3 (20).
  26. How-Possibly Explanations in (Quantum) Computer Science.Michael E. Cuffaro - 2015 - Philosophy of Science 82 (5):737-748.
    A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples little is gained in subsequently asking a (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  27. Erratum To: Limit Computable Integer Parts.Paola D’Aquino, Julia Knight & Karen Lange - 2015 - Archive for Mathematical Logic 54 (3-4):487-489.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28. Ramsey-Type Graph Coloring and Diagonal Non-Computability.Ludovic Patey - 2015 - Archive for Mathematical Logic 54 (7-8):899-914.
    A function is diagonally non-computable if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which functions h, the principle stating the existence of an h-bounded d.n.c. function implies Ramsey-type weak König’s lemma. In this paper, we prove that for every computable order h, there exists an ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\omega}$$\end{document} -model of h-DNR which is not a not (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29. B. Jack Copeland, Carl J. Posy, and Oron Shagrir, Eds, Computability: Turing, Gödel, Church, and Beyond. Cambridge, Mass.: MIT Press, 2013. ISBN 978-0-262-01899-9. Pp. X + 362. [REVIEW]Roy T. Cook - 2014 - Philosophia Mathematica 22 (3):412-413.
  30. Domatic Partitions of Computable Graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
    Given a graph G, we say that a subset D of the vertex set V is a dominating set if it is near all the vertices, in that every vertex outside of D is adjacent to a vertex in D. A domatic k-partition of G is a partition of V into k dominating sets. In this paper, we will consider issues of computability related to domatic partitions of computable graphs. Our investigation will center on answering two types of questions for (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Resolving the Infinitude Controversy.András Kornai - 2014 - Journal of Logic, Language and Information 23 (4):481-492.
    A simple inductive argument shows natural languages to have infinitly many sentences, but workers in the field have uncovered clear evidence of a diverse group of ‘exceptional’ languages from Proto-Uralic to Dyirbal and most recently, Pirahã, that appear to lack recursive devices entirely. We argue that in an information-theoretic setting non-recursive natural languages appear neither exceptional nor functionally inferior to the recursive majority.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32. Levels of Discontinuity, Limit-Computability, and Jump Operators.de Brecht Matthew - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 79-108.
  33. The Equivalence of Bar Recursion and Open Recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
    Several extensions of Gödel's system TT with new forms of recursion have been designed for the purpose of giving a computational interpretation to classical analysis. One can organise many of these extensions into two groups: those based on bar recursion , which include Spector's original bar recursion, modified bar recursion and the more recent products of selections functions, or those based on open recursion which in particular include the symmetric Berardi–Bezem–Coquand functional. We relate these two groups by showing that both (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  34. Computability in Europe 2011.Sam Buss, Benedikt Löwe, Dag Normann & Ivan Soskov - 2013 - Annals of Pure and Applied Logic 164 (5):509-510.
  35. Turing’s Algorithmic Lens: From Computability to Complexity Theory.Josep Díaz & Carme Torras - 2013 - Arbor 189 (764):a080.
  36. On the Kolmogorov Complexity of Continuous Real Functions.Amin Farjudian - 2013 - Annals of Pure and Applied Logic 164 (5):566-576.
    Kolmogorov complexity was originally defined for finitely-representable objects. Later, the definition was extended to real numbers based on the asymptotic behaviour of the sequence of the Kolmogorov complexities of the finitely-representable objects—such as rational numbers—used to approximate them.This idea will be taken further here by extending the definition to continuous functions over real numbers, based on the fact that every continuous real function can be represented as the limit of a sequence of finitely-representable enclosures, such as polynomials with rational coefficients.Based (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  37. Conditional Computability of Real Functions with Respect to a Class of Operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.
    For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect to this class. These two computability notions are natural generalizations of certain notions introduced in a previous paper co-authored by Andreas Weiermann and in another previous paper by the same authors, respectively. Under certain weak assumptions about the class in question, (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38. Function Logic and the Theory of Computability.Jaakko Hintikka - 2013 - APA Newsletter on Philosophy and Computers 13 (1):10-19.
    An important link between model theory and proof theory is to construe a deductive disproof of S as an attempted construction of a countermodel to it. In the function logic outlined here, this idea is implemented in such a way that different kinds of individuals can be introduced into the countermodel in any order whatsoever. This imposes connections between the length of the branches of the tree that a disproof is and their number. If there are already n individuals in (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark   1 citation  
  39. When Series of Computable Functions with Varying Domains Are Computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  40. Iteration on Notation and Unary Functions.Stefano Mazzanti - 2013 - Mathematical Logic Quarterly 59 (6):415-434.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  41. Computing Links and Accessing Arcs.Timothy H. McNicholl - 2013 - Mathematical Logic Quarterly 59 (1-2):101-107.
    Sufficient conditions are given for the computation of an arc that accesses a point on the boundary of an open subset of the plane from a point within the set. The existence of a not-computably-accessible but computable point on a computably compact arc is also demonstrated.
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  42. 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 instrument (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Effective Algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.
    Results of R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an algebraic field when viewed as a subfield of its algebraic closure. Here, we show that the same computable categoricity results also hold for finite-branching trees under the predecessor function and for connected, finite-valence, pointed graphs, and we show that the degree spectrum results do not hold for (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Computability in Europe 2009.Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe - 2012 - Annals of Pure and Applied Logic 163 (5):483-484.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45. Algorithmic Randomness, Reverse Mathematics, and the Dominated Convergence Theorem.Jeremy Avigad, Edward T. Dean & Jason Rute - 2012 - Annals of Pure and Applied Logic 163 (12):1854-1864.
    We analyze the pointwise convergence of a sequence of computable elements of L1 in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA0, each is equivalent to the assertion that every Gδ subset of Cantor space with positive measure has an element. This last statement is, in turn, equivalent to weak weak Königʼs lemma relativized to the Turing jump of any set. It is also equivalent to the (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  46. Randomness and Lowness Notions Via Open Covers.Laurent Bienvenu & Joseph S. Miller - 2012 - Annals of Pure and Applied Logic 163 (5):506-518.
  47. Computability in Europe 2010.Fernando Ferreira, Martin Hyland, Benedikt Löwe & Elvira Mayordomo - 2012 - Annals of Pure and Applied Logic 163 (6):621-622.
  48. Computable de Finetti Measures.Cameron E. Freer & Daniel M. Roy - 2012 - Annals of Pure and Applied Logic 163 (5):530-546.
  49. Noncomputability, Unpredictability, and Financial Markets.Daniel S. Graça - 2012 - Complexity 17 (6):24-30.
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50. Laws of Form and the Force of Function: Variations on the Turing Test.Hajo Greif - 2012 - In Vincent C. Müller & Aladdin Ayesh (eds.), Revisiting Turing and His Test: Comprehensiveness, Qualia, and the Real World. AISB. pp. 60-64.
    This paper commences from the critical observation that the Turing Test (TT) might not be best read as providing a definition or a genuine test of intelligence by proxy of a simulation of conversational behaviour. Firstly, the idea of a machine producing likenesses of this kind served a different purpose in Turing, namely providing a demonstrative simulation to elucidate the force and scope of his computational method, whose primary theoretical import lies within the realm of mathematics rather than cognitive modelling. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  51. Nothing in this category. Everyone can categorize entries. Please help if you have the expertise.