 
|
|
|
|
|
|
|
|
|
MAM073 Theory of computation 6.0 ECTS credits | |
|
TIMEPERIOD: LANGUAGE:Swedish EXAMINER T Gunnarsson Univ lekt PREREQUISITES Recommended prerequisites: MAM053 COURSE AIM The aim of the course is to give knowledge about what is possible to compute and about some models of computation. CONTENTS Formal languages and automata, recursive functions, turing machines, lambda calculus, grammars, grammatical calculations, Church's thesis and the question about what is possible to compute, something about the theory of complexity. TEACHING The teaching consists of lectures and tutorials. In the lectures new notions are presented, theorems are formulated and proved, algorithms are explained and applied to problems. Exercises that need work with computers outside scheduled hours may occur. The course can in its entirety or in part be taught in english. EXAMINATION The examination consists of written and oral examination. Grading with option A in "Regler för tentamen". COURSE GRADE SCALE: 3, 4, 5 ITEMS/CREDITS | |
| Written exam | 6.00ECTS |
|
COURSE LITERATURE H.r. Lewis, C.H. Papadimitriov: Elements of the theory of computation, 1981, Prentice-Hall REMARKS The course is offered every second year alternating with the course Logic MAM096. The course was given 95/96 |
Web Editor: Karin.Lindholm@dc.luth.se
| The University | Student | Research | Search | Contact us | In Swedish |
 LULEÅ UNIVERSITY OF TECHNOLOGY University Campus, Porsön, 971 87 Luleå. Tel. +46 (0) 920-91 000, fax +46 (0) 920-91 399 |