Turing reduction - PDFSEARCH.IO - Document Search Engine

Turing reduction
Results: 43

#	Item
1	MCS 441 – Theory of Computation I Syllabus Lev Reyzin SpringTime and Location: M-W-F, 12:00-12:50pm, Lincoln Hall (TH) 205 Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-01-11 11:14:04 Theory of computation Theoretical computer science Computability theory Computer science Alan Turing Turing machine Computational complexity theory Computability Reduction Halting problem Complexity ChurchTuring thesis
2	Computability 1 Tao Jiang Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2002-01-28 23:36:37 Computability theory Theory of computation Turing machine Models of computation Theoretical computer science Computability Algorithm Halting problem Reduction Computable function NP Complexity class
3	Computational Irreducibility and Computational Analogy Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2015-10-12 16:05:50 Computability theory Theory of computation Turing machine Alan Turing Models of computation Computability ChurchTuring thesis Computable function Algorithm Reduction Turing completeness Machine that always halts
4	Journal of Statistical Physics, Vol. 104, Nos. 3/4, 2001 Computational Mechanics: Pattern and Prediction, Structure and Simplicity Cosma Rohilla Shalizi 1 , 2 and James P. Crutchfield 1 Received June 20, 2000; revised F Add to Reading List Source URL: bactra.org Language: English - Date: 2003-10-31 16:37:58 Complex systems theory Theoretical computer science Computability theory Statistical randomness Randomness Kolmogorov complexity Complexity Emergence Computational complexity theory Algorithm Reduction Turing machine
5	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
6	Models of Computation Lecture 8: Undecidiability [Fa’14] Caveat lector: This is the zeroth (draft) edition of this lecture note. Please send bug reports and suggestions to . Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:05:16 Computability theory Theory of computation Turing machine Models of computation Universal Turing machine Computability Reduction NP Halting problem Theoretical computer science Applied mathematics Mathematics
7	δ-uniform BSS Machines Paolo Boldi* Sebastiano Vigna∗ Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy. Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:52:47 Computer science Theory of computation Models of computation Alan Turing Turing machine Computable number Computability Reduction NP Theoretical computer science Computability theory Applied mathematics
8	The Turing Closure of an Archimedean Field Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:52:19 Applied mathematics Theory of computation Alan Turing Models of computation Turing machine Computability Turing degree Computable number Reduction Theoretical computer science Computability theory Computer science
9	AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION R. BHASKAR, K. CHANDRASEKARAN, S. LOKAM, P.L. MONTGOMERY, R. VENKATESAN, AND Y. YACOBI Abstract. We generalize the Strong Boneh-Boyen (SBB) signature sche Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-16 15:26:16 Finite fields Computability theory Alan Turing Turing reduction Reduction Diffie–Hellman problem Theoretical computer science Applied mathematics Computational complexity theory
10	Visualizing the Turing Tarpit Jason Hemann Eric Holk Indiana University Add to Reading List Source URL: www.cs.indiana.edu Language: English - Date: 2013-07-06 00:24:10 Applied mathematics Iota and Jot Combinatory logic Beta normal form Evaluation strategy Jot Binary lambda calculus Reduction strategy Lambda Lambda calculus Theoretical computer science Mathematical logic