Even Turing machines can compute uncomputable functions
From MaRDI portal
Recommendations
Cited in
(16)- A new conceptual framework for analog computation
- Mirror notations: Symbol manipulation without inscription manipulation
- Super-tasks, accelerating Turing machines and uncomputability
- The modal argument for hypercomputing minds
- Hypercomputation: Philosophical issues
- Supertasks do not increase computational power
- Analog computation beyond the Turing limit
- The many forms of hypercomputation
- A note on accelerated Turing machines
- Computing with polynomial ordinary differential equations
- scientific article; zbMATH DE number 1869997 (Why is no real title available?)
- Turing machines can be efficiently simulated by the general purpose analog computer
- Mathematical and technological computability
- A Survey on Analog Models of Computation
- Physical computability theses
- Real recursive functions and their hierarchy
This page was built for publication: Even Turing machines can compute uncomputable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838839)
