Sign up to save your podcasts
Or
Share Het Entscheidungsproblem, de Church-Turing these en het coderen van Turingmachines en problemen
Share to email
Share to Facebook
Share to X
Share to email
Share to Facebook
Share to X
Or
Het Entscheidungsproblem, de Church-Turing these en het coderen van Turingmachines en problemen
TI2320 (IN2505-II). Berekenbaarheidstheorie.
"Hilbert's Entscheidungsproblem is undecidable! The common belief that the intuitive notion of computability is adequately modelled by the formal notion of Turing machine (defined by Alan Turing) or by the lambda calculus (invented by Alonzo Church) is called the Church-Turing Thesis. Turing machines and problems can be coded as natural numbers (or otherwise): a programme is a natural number!"
View all episodes
By TI2320 (IN2505-II). Berekenbaarheidstheorie.
"Hilbert's Entscheidungsproblem is undecidable! The common belief that the intuitive notion of computability is adequately modelled by the formal notion of Turing machine (defined by Alan Turing) or by the lambda calculus (invented by Alonzo Church) is called the Church-Turing Thesis. Turing machines and problems can be coded as natural numbers (or otherwise): a programme is a natural number!"
More shows like Berekenbaarheidstheorie
View all
Agent Based Modeling of Complex Adaptive Systems
4 Listeners
Guest lectures
1 Listeners
Hydrology of catchments rivers and deltas
3 Listeners
Flight and Orbital Mechanics
1 Listeners