Complexity 6 (1):35-37 (2000)

Authors
Cristian S. Calude
University of Auckland
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1002/1099-0526(200009/10)6:1 3.0.CO;2-T
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,339
Through your library

References found in this work BETA

Computability by Probabilistic Machines.K. de Leeuw, E. F. Moore, C. E. Shannon & N. Shapiro - 1970 - Journal of Symbolic Logic 35 (3):481-482.
Algorithms for Quantum Computation: Discrete Logarithms and Factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.
The Unknowable.Gregory J. Chaitin - 2002 - Studia Logica 70 (2):299-302.

Add more references

Citations of this work BETA

Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.

Add more citations

Similar books and articles

The Initialization Problem in Quantum Computing.Subhash Kak - 1999 - Foundations of Physics 29 (2):267-279.
Quantum Hypercomputation.Tien D. Kieu - 2002 - Minds and Machines 12 (4):541-561.
Quantum Gravity on a Quantum Computer?Achim Kempf - 2014 - Foundations of Physics 44 (5):472-482.
Quantum Algorithms: Philosophical Lessons.Amit Hagar - 2007 - Minds and Machines 17 (2):233-247.

Analytics

Added to PP index
2014-01-20

Total views
17 ( #613,753 of 2,448,775 )

Recent downloads (6 months)
1 ( #445,251 of 2,448,775 )

How can I increase my downloads?

Downloads

My notes