<--- Back to Details
First PageDocument Content
Computability theory / Theory of computation / Models of computation / Turing machine / Complexity classes / Undecidable problem / Halting problem / Penrose tiling / Aperiodic tiling / Theoretical computer science / Mathematics / Applied mathematics
Date: 2010-02-10 08:51:26
Computability theory
Theory of computation
Models of computation
Turing machine
Complexity classes
Undecidable problem
Halting problem
Penrose tiling
Aperiodic tiling
Theoretical computer science
Mathematics
Applied mathematics

Add to Reading List

Source URL: www.ams.org

Download Document from Source Website

File Size: 233,33 KB

Share Document on Facebook

Similar Documents

Latent Domain Phrase-based Models for Adaptation Hoang Cuong and Khalil Sima’an Institute for Logic, Language and Computation University of Amsterdam Science Park 107, 1098 XG Amsterdam, The Netherlands {c.hoang,k.sima

DocID: 1uFJW - View Document

Grown-in Defects of InSb Crystals: Models and Computation N. Vaidya ∗, H. Huang †, and D. Liang ‡ Department of Mathematics & Statistics, York University Toronto, Canada M3J 1P3. August 22, 2005

DocID: 1u9va - View Document

NUMERICAL SOLUTION of MARKOV CHAINS, p. 1–22 Hypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models ∗

DocID: 1u2vA - View Document

The Myriad simulator: parallel computation for densely integrated models Pedro Rittner , Andrew J. Davies, Thomas A. Cleland 1 Dept. of Psychology, Cornell University, Ithaca, NY Why another simulator?

DocID: 1tZVk - View Document

Aggregating Private Sparse Learning Models Using Multi-Party Computation Lu Tian, Bargav Jayaraman, Quanquan Gu, and David Evans University of Virginia https://oblivc.org/ppml

DocID: 1tvdd - View Document