Can Turing machines capture everything we can compute?
Bhupinder Singh Anand
Abstract
If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are not Turing-computable.
Create a lesson
Related papers
Even and Odd Integer Values of the Secondary Zeta Function
Artur Kawalec
Generalized Pellet's theorem for analytic matrix-valued functions
Hiromochi Itoh, Kei Matsushima, Takayuki Yamada
Certifying non-existence of integer points on curves
Bogdan Grechuk, Eugene Go
A finite coefficient theory for shape identification in tilted generalized gamma families
Ran Huang
There are only finitely many irregular Diophantine quadruples
Bo He, Alain Togbe
A Multipatch Model for Evaluating Interdivisional Connectivity and Vaccination Dynamics in the 2026 Bangladesh Measles Outbreak
Faizunnesa Khondaker, Md. Kamrujjaman