Abstract / résuméCUMC / CCEM 2005



Brendan Cordy

Name / nom: Brendan Cordy

School / école: Queen's University at Kingston

Length / durée: 25 min

Title / titre: Recursive and Recursively-Enumerable Sets

Abstract / résumé: Introduction to the workings of recursive functions, primitive and mu-recursion, partial recursive functions, and the definition of recursive and recursively-enumerable sets. Results about recursive and recursively-enumerable sets, including a proof that there are non-recursively-enumerable sets by diagonalization, and implications of these results in computing science and mathematics including Hilbert's Tenth Problem and Matiyasevich's Theorem.

Prerequisites / choses nécessaires: None listed.



PDF format / format PDF: cordy.pdf