Turing incomputable computation
From MaRDI portal
Cites work
- ``Neural computation of decisions in optimization problems
- A logical calculus of the ideas immanent in nervous activity
- An Unsolvable Problem of Elementary Number Theory
- Communication Theory of Secrecy Systems*
- Computability and Recursion
- Computability of Recursive Functions
- scientific article; zbMATH DE number 3880670 (Why is no real title available?)
- scientific article; zbMATH DE number 3727583 (Why is no real title available?)
- scientific article; zbMATH DE number 3737613 (Why is no real title available?)
- scientific article; zbMATH DE number 3595145 (Why is no real title available?)
- scientific article; zbMATH DE number 861256 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- Neural networks and physical systems with emergent collective computational abilities
- Non-Turing computations via Malament--Hogarth space-times
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The active element machine
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Why there is no such discipline as hypercomputation
This page was built for publication: Turing incomputable computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874963)
