First Page | Document Content | |
---|---|---|
![]() Date: 2005-09-29 06:19:55Computability theory Randomness Theory of computation Turing machine Mathematical logic Kolmogorov complexity Complexity Algorithmically random sequence Universal Turing machine Theoretical computer science Mathematics Applied mathematics | Source URL: www.daimi.au.dkDownload Document from Source WebsiteFile Size: 89,62 KBShare Document on Facebook |
![]() | Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document |
![]() | Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document |
![]() | Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document |
![]() | Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document |
![]() | CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |