TI2320 (IN2505-II). Berekenbaarheidstheorie.

"Enumerability is introduced as an alternative to recognisability: the Turing machine as an enumerator instead of as a recogniser. The proof of equivalence of both notions uses the so-called technique of "dove tailing". A first, seemingly simple, undecidable language is presented: Hilbert's tenth problem."

TI2320 (IN2505-II). Berekenbaarheidstheorie. "Enumerability is introduced as an alternative to recognisability: the Turing machine as an enumerator instead of as a recogniser. The proof of equivalence of both notions uses the so-called technique of "dove tailing". A first, seemingly simple, undecidable language is presented: Hilbert's tenth problem."

Share Opsommers en het 10e probleem van Hilbert

Sign up to save your podcasts

Opsommers en het 10e probleem van Hilbert

Opsommers en het 10e probleem van Hilbert

More shows like Berekenbaarheidstheorie

Agent Based Modeling of Complex Adaptive Systems

Guest lectures

Hydrology of catchments rivers and deltas

Flight and Orbital Mechanics