<--- Back to Details
First PageDocument Content
Computability theory / Randomness / Theory of computation / Turing machine / Mathematical logic / Kolmogorov complexity / Complexity / Algorithmically random sequence / Universal Turing machine / Theoretical computer science / Mathematics / Applied mathematics
Date: 2005-09-29 06:19:55
Computability theory
Randomness
Theory of computation
Turing machine
Mathematical logic
Kolmogorov complexity
Complexity
Algorithmically random sequence
Universal Turing machine
Theoretical computer science
Mathematics
Applied mathematics

Add to Reading List

Source URL: www.daimi.au.dk

Download Document from Source Website

File Size: 89,62 KB

Share Document on Facebook

Similar Documents

Cryptography / Computational complexity theory / Complexity classes / Interactive proof system / Zero-knowledge proof / NP / Probabilistically checkable proof / IP / Soundness / Commitment scheme / NEXPTIME / P versus NP problem

The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138

DocID: 1xW3t - View Document

Economy / Computing / Financial services / Software architecture / Banking / Multitenancy / Core banking / Cloud computing / Java / Business process management / Bank / Application server

Platform technology Manage business growth and complexity with a highly scalable, efficient and flexible platform. Platform

DocID: 1xVY8 - View Document

Metaphysics / Chaos theory / Complex systems theory / Butterfly effect

Chaos, Complexity, and Statistical MechanicsChaos, Complexity, and Statistical Mechanics

DocID: 1xVS6 - View Document

Domain name system / Internet / Computing / Network architecture / Extension mechanisms for DNS / Name server / OpenDNS / DNS hijacking / Comparison of DNS server software

DNS-sly: Avoiding Censorship through Network Complexity Qurat-Ul-Ann Danyal Akbar Northwestern University Marcel Flores Northwestern University

DocID: 1xVDj - View Document

Proof theory / Mathematical logic / Logic / Mathematics / Sequent / Natural deduction / Cut-elimination theorem / Admissible rule / Proof complexity / Propositional calculus / Structural rule / Cut rule

Under consideration for publication in Math. Struct. in Comp. Science Complexity of Translations from Resolution to Sequent Calculus (Presentation-Only - Draft) Giselle Reis1 and Bruno Woltzenlogel Paleo2

DocID: 1xVA3 - View Document