Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. Except for a general mathematical background no preliminary knowledge is presupposed, but some experience in programming may be helpful. While classical treatises on computability and decidability are oriented towards the foundation of mathematics or mathematical logic, the present notes try to relate the subject to computer science. Therefore, the expose is based on the use of strings rather than on that of natural numbers; the notations are similar to those in use in automata theory; in addition, according to a common usage in formal language theory, most of the proofs of computability are reduced to the semi-formal description of a procedure the constructivity of which is apparent to anybody having some programming experience. Notwithstanding these facts the subject is treated with mathematical rigor; a great number of informal comments are inserted in order to allow a good intuitive understanding. I am indebted to all those who drew my attention to some errors and ambiguities in a preliminary version of these Notes. I want also to thank Miss L.A. Krukerink for her diligence in typing the manuscript.

Computer. Automation --- 681.3*F11 --- 681.3*F4 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic and formal languages (Theory of computation) --- Engineering & Applied Sciences --- Computer Science --- Sequential machine theory. --- Turing machines. --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Sequential machine theory --- Turing machines --- Théorie des machines séquentielles --- Machines de Turing --- Théorie des machines séquentielles --- Computable functions --- Fonctions calculables --- Fonctions calculables. --- Informatique --- Computer science --- Langages de programmation --- Programming languages (Electronic computers)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Machine theory --- Formal languages --- Computer programming --- Automates mathématiques, Théorie des --- Langages formels --- Programmation (Informatique) --- Congresses --- Congrès --- Automates mathématiques, Théorie des --- Congrès --- #TCPW P3.0 --- #TCPW P4.1 --- 681.3*A0 --- 681.3*F1 --- Computation by abstract devices --- 681.3*F1 Computation by abstract devices --- 681.3*A0 General --- Computer science --- #TCPW P5.1 --- 681.3*D3 --- 681.3*F0 --- 681.3*D3 Programming languages --- Programming languages --- General --- Computerwetenschap--?*F0 --- Information theory. --- Computer science. --- Theory of Computation. --- Computer Science, general. --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Langages de programmation --- Programmation système (informatique)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer programs --- Verification --- Computer programs - Verification

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Langages de programmation