Computability - NUIN007
|
|
|
||
Last update: T_KTI (23.04.2001)
|
|
||
Last update: G_I (17.05.2004)
Partial recursive functions as a basic computational model, some other computational model (Turing machines or flowchart diagrams), their equivalence. The Normal Form Theorem, recursively enumerable sets and the Halting Problem, m-reducibility and m-completeness, productive sets, Rice's Theorem, some connections to logic. |