Computability - PDFSEARCH.IO - Document Search Engine

Computability
Results: 1315

#	Item
941	¯ The λλ-calculus A dual calculus for unconstrained strategies Alexis Goyet PPS, Universit´ Add to Reading List Source URL: 91.121.110.215 Language: English - Date: 2013-09-26 02:18:34 Formal methods Computability theory Lambda calculus Function Combinatory logic Fixed-point combinator Mathematics Mathematical logic Theoretical computer science
942	CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa Add to Reading List Source URL: www.dklevine.com Language: English - Date: 2006-03-16 11:03:47 Applied mathematics Alan Turing Turing machine Theory of computation Models of computation Computability NP Machine that always halts Halting problem Theoretical computer science Computability theory Mathematics
943	The λλ¯ -calculus A dual calculus for unconstrained strategies Alexis Goyet Univ Paris Diderot, Sorbonne Paris Cit´e, PPS, UMR 7126, CNRS, F[removed]Paris, France Add to Reading List Source URL: 91.121.110.215 Language: English - Date: 2013-09-26 02:18:34 Computability theory Lambda calculus Theoretical computer science Model theory Interpretation Spectral theory of ordinary differential equations Symbol Logic Mathematics Mathematical logic
944	The complexity of computable entailment Benedict Eastaugh [removed] Department of Philosophy University of Bristol Add to Reading List Source URL: extralogical.net Language: English - Date: 2014-05-22 10:36:49 Computability theory Proof theory Epistemology Reverse mathematics Foundations of mathematics Second-order arithmetic Constructivism Entailment Solomon Feferman Logic Mathematics Mathematical logic
945	Turing, A.M. (1950). Computing machinery and intelligence. Mind, 59, 433-‐460. COMPUTING MACHINERY AND INTELLIGENCE By A. M. Turing Add to Reading List Source URL: www.dingli.org Language: English - Date: 2013-10-01 03:12:46 Science Computer science Models of computation Computability theory Philosophy of mind Computing Machinery and Intelligence Strong AI Computer Turing test Philosophy of artificial intelligence Artificial intelligence Alan Turing
946	NO TURING MACHINE CAN REPLICATE AN ARBITRARILY CHOSEN TURING MACHINE BY OBSERVING ITS RESPONSES Kerry M. Soileau November 9, 2005 ABSTRACT Add to Reading List Source URL: www.kerrysoileau.com Language: English - Date: 2008-09-08 17:17:41 Computability theory Theory of computation Models of computation Turing machine Alan Turing Computability Hyperconnected space Reduction NP Theoretical computer science Applied mathematics Computer science
947	Theory of computation: Summary of main concepts 6. Effective computability: Turing machines Universal TM (UTM) interpreter that reads the description of any arbitrary TM M and executes operations on Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:13 Computer science Turing machine Alan Turing Formal languages Halting problem Machine that always halts Computability Church–Turing thesis Computable function Computability theory Theoretical computer science Theory of computation
948	¨ SPACES OF SINGULAR HEREDITARILY LINDELOF DENSITY ´ JUHASZ ´ ISTVAN Add to Reading List Source URL: www.math-inst.hu Language: English - Date: 2010-08-29 05:46:51 Mathematics Operator theory Ordinary differential equations Philosophy of mathematics Computability theory Spectral theory of ordinary differential equations Logic Decomposition of spectrum Spectral theory Forcing Constructible universe
949	Free University of Bolzano, Prof. J. Nievergelt: Formal Languages, Sem 1, Fall 2006 Oct 02 Models of computation: Ruler and compass, systolic arrays, finite state machines Oct 02 Lab Kara: study examples and write a pr Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2006-11-23 06:52:35 Computability theory Models of computation Turing machine Computability Finite-state machine Automata theory Halting problem Busy beaver Computable function Theoretical computer science Computer science Theory of computation
950	1. Models of computation jn[removed]Goals: An intuitive appreciation of the importance of the concept ‘model of computation’. Acquaintance with several interesting examples that mirror key aspects of realistic sy Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:16 Models of computation Computability theory Formal methods Neural networks Lambda calculus Algorithm Computability Perceptron Artificial neural network Theoretical computer science Applied mathematics Computer science