<--- Back to Details
First PageDocument Content
Mathematical logic / Applied mathematics / Computable function / Recursive set / Enumeration / Function / Numbering / Church–Turing thesis / Computability / Computability theory / Theory of computation / Mathematics
Date: 2011-01-28 11:35:52
Mathematical logic
Applied mathematics
Computable function
Recursive set
Enumeration
Function
Numbering
Church–Turing thesis
Computability
Computability theory
Theory of computation
Mathematics

On the completeness of quantum computation models Pablo Arrighi ´ Ecole normale sup´erieure de Lyon

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 176,63 KB