Undecidable problem - PDFSEARCH.IO - Document Search Engine

Undecidable problem
Results: 16

#	Item
1	Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary Add to Reading List Source URL: philosopher-animal.com Language: English - Date: 2007-04-18 22:48:16 Mathematics Theoretical computer science Theory of computation Structural complexity theory Computability theory Halting problem Mathematical proof Undecidable problem Negation Reductio ad absurdum Reduction Square root of 2
2	UNSOLVABLE PROBLEMS AND PHILOSOPHICAL PROGRESS American Philosophical Quarterly–298 William J. Rapaport Department of Computer Science and Engineering, Department of Philosophy, and Center for Cognitive S Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2010-01-05 13:19:53 Historiography Metanarratives Philosophy of science Metaphilosophy Logic in computer science Undecidable problem Philosophical progress Logic Progress Science Philosophy Mathematics
3	Chapter 4: Computability Algorithmic Adventures From Knowledge to Magic Book by Juraj Hromkoviˇ Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:09:33 Computability theory Mathematical logic Theory of computation Logic in computer science Proof theory Undecidable problem Decision problem Algorithm Computability Theoretical computer science Mathematics Applied mathematics
4 $CS109B Notes for LectureUnsolvable Problems Some problems have \ecient$	CS109B Notes for LectureUnsolvable Problems Some problems have \ecient" solutions, i.e., Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:59:26 Theory of computation Computability theory Halting problem Reduction Undecidable problem Computable function Computability Function Algorithm Theoretical computer science Mathematics Applied mathematics
5	COMS11700 Undecidability Ashley Montanaro Department of Computer Science, University of Bristol Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-05-31 09:18:34 Computability theory Theory of computation Alan Turing Turing machine Proof theory Undecidable problem Machine that always halts Decidability Church–Turing thesis Theoretical computer science Mathematics Mathematical logic
6	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: levine.sscnet.ucla.edu 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
7	SCOOPING THE LOOP SNOOPER A proof that the Halting Problem is undecidable Geoffrey K. Pullum School of Philosophy, Psychology and Language Sciences, University of Edinburgh No general procedure for bug checks succeeds. Add to Reading List Source URL: oldblog.computationalcomplexity.org Language: English - Date: 2009-05-18 12:12:50 Computability theory Computing Theory of computation Halting problem Infinite loop Software bugs Computer programming Mathematics
8	Could a purpose built supercomputer play DEF CON Capture the Flag? Mike Walker Program Manager Approved for Public Release, Distribution Unlimited Add to Reading List Source URL: cgc.darpa.mil Language: English - Date: 2014-07-31 13:05:00 Games Recreation Model theory Proof theory Capture the flag Competitive programming DEF CON Undecidable problem Software distribution Mathematical logic First-person shooters TopCoder
9	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
10	Specimen Magazine Issue 1 Final Edits Add to Reading List Source URL: specimenmagazine.org Language: English - Date: 2013-01-17 09:50:08 Complexity classes Models of computation Open problems Mathematical optimization SL Theory of computation Computational complexity theory Algorithm Undecidable problem Theoretical computer science Applied mathematics Mathematics