The Church-Turing thesis and its look-alikes

@article{BenAmram2005TheCT,
  title={The Church-Turing thesis and its look-alikes},
  author={A. Ben-Amram},
  journal={SIGACT News},
  year={2005},
  volume={36},
  pages={113-114}
}
  • A. Ben-Amram
  • Published 2005
  • Mathematics, Computer Science
  • SIGACT News
"A function is mechanically computable (that is: computable by means of a machine) if and only if it is Turing-computable." 
On the Church-Turing thesis
After a brief description of the Church-Turing Thesis, we suggest that, according to the latest results on classical recursive probabilistic solution of the Halting Problem, such thesis isExpand
N ov 2 00 6 On the Church-Turing thesis
After a brief description of the Church-Turing thesis, we suggest that, according to the latest results on classical recursive probabilistic solution of the Halting Problem, such thesis isExpand
A Bibliography of Publications of Alan Mathison Turing
This bibliography records publications of Alan Mathison Turing (1912{ 1954). Title word cross-reference [Tur37a]. K [Tur37c]. p [Tur37c]. -conversion [Tur37c]. -de nability [Tur37a]. -functionExpand
Peptide Computing - Universality and Theoretical Model
TLDR
It is proved that a peptide computing model can be simulated by a Turing machine under certain conditions. Expand
On the universality of peptide computing
TLDR
This new technique simulates the computation steps automatically by the interaction between peptides and antibodies and does not rely on a "look-and-do" approach, in which the Turing machine program would be interpreted by an extraneous computing agent. Expand
Applying computational complexity to the emergence of classicality
Can the computational complexity theory of computer science and mathematics say something new about unresolved problems in quantum physics? Particularly, can the P versus NP question in theExpand
The Foundations of Computability Theory
The central notions in this book are those of the algorithm and computation, not a particular algorithm for a particular problem or a particular computation, but the algorithm and computation inExpand
Correspondence principle as equivalence of categories
If quantum mechanics were to be applicable to macroscopic objects, classical mechanics would have to be a limiting case of quantum mechanics. Then the category Set that packages classical mechanicsExpand
Accelerated Quantum Computation by means of Evanescent Photons and its Prospects for Optical Quantum Hypercomputers and Artificial Intelligence
  • L. Caligiuri, T. Musha
  • Computer Science
  • 2019 International Conference on Engineering, Science, and Industrial Applications (ICESI)
  • 2019
TLDR
It is shown it could be possible to overcome this “barrier” by considering a quantum system based on evanescent photons produced inside optical components made of metamaterials and opening very interesting perspectives towards the realization of quantum optical supercomputer systems based on this new kind of technology. Expand
A review of "Memcomputing NP-complete problems in polynomial time using polynomial resources" (arXiv: 1411.4798)
TLDR
The paper reports a physical device and claims that this device solves a particular NP-complete problem using only polynomial time and space, and reports the possibility of a physical realization of a non-deterministic Turing machine (or an equivalent). Expand
...
1
2
...

References

SHOWING 1-2 OF 2 REFERENCES
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
ACM SIGACT News
  • ACM SIGACT News