文件名称：Models of Computation
文件大小：3.88MB
文件格式：PDF
更新时间：2022-02-06 09:18:58
computation models
This course introduces the classical mathematical models used to analyse computation, including finite state automata, grammars, and Turing Machines. A computer scientist should be able to distinguish between what can be computed and what cannot. This distinction can only be made with a good scientific model of computers and computation. This course introduces the powerful idea of using a mathematical model to analyse computation. This course describes a number of different models of computation which were proposed and analysed over the past century. Many of these models were found to be equivalent, in the sense that they allow exactly the same computations to be carried out. Other models were shown to be less powerful, but simpler to implement, and so useful for some purposes.