Name: computability and decidability: an introduction for students of computer science (en Inglés)
SKU: 25910778
Price: 59.56 USD
Availability: InStock
Author: Loeckx, J.
ISBN: 9783540058694

portada computability and decidability: an introduction for students of computer science (en Inglés)

computability and decidability: an introduction for students of computer science (en Inglés)

Formato

Libro Físico

Autor

J. Loeckx

Editorial

Springer

Año

1972

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

Dimensiones

25.4x17.8x0.4 cm

Peso

0.16 kg.

ISBN

3540058699

ISBN13

9783540058694

Categorías

Ciencia y análisis de datos: generalidades
Análisis y captura de datos
Ciencias de la computación

computability and decidability: an introduction for students of computer science (en Inglés)

J. Loeckx (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 108.30$ 59.56

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 59.56

Llega entre el 22 Sep y el 05 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "computability and decidability: an introduction for students of computer science (en Inglés)"

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.