Imagen de cubierta local
Imagen de Amazon.com
Computability and computational complexity : a practical introduction to the mathematical theory of computing / Levis Zerpa y Roberth Narváez
Tipo de material:
TextoIdioma: Inglés Fecha de copyright: Ibarra : Graficolor, 2022Edición: Second editionDescripción: 204 pages : illustrations ; 24 cmISBN: - 9789942874733
- 005.1
Contenidos:
1 Introduction: solving the logico-philosophical problem of computability theory --
2 Lambda-calculus: basic concepts, currying, syntax --
3 Lambda-calculus: substitution, reduction, Church-Rosser theorem --
4 Lambda-calculus: outline of the application to computability --
5 Lambda-calculus: all computable functions are lambda-definable --
6 Lambda-calculus: undecidability --
7 The weak call-by-value lambda-calculus and Turing machines --
8 Brief introduction to time complexity
| Tipo de ítem | Biblioteca actual | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | |
|---|---|---|---|---|---|---|---|---|
Colección general
|
Biblioteca Yachay Tech | 005.1 Z54c 2022 (Navegar estantería(Abre debajo)) | Ej. 1 | Disponible | 003202 | |||
|
Colección general
|
Biblioteca Yachay Tech | 005.1 Z54c 2022 (Navegar estantería(Abre debajo)) | Ej. 2 | Disponible | 003203 |
Total de reservas: 0
Navegando Biblioteca Yachay Tech estanterías Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
|
|
|
|
|
|
|
||
| 005.1 Y48s 2012 A short course in computational science and engineering : | 005.1 Y48s 2012 A short course in computational science and engineering : | 005.1 Y48s 2012 A short course in computational science and engineering : | 005.1 Z54c 2022 Computability and computational complexity : a practical introduction to the mathematical theory of computing / | 005.1 Z54c 2022 Computability and computational complexity : a practical introduction to the mathematical theory of computing / | 005.1015113 H979l 2004 Logic in computer science : | 005.11 R1477e 2013 Expert C# 5.0 with .NET 4.5 framework / |
Includes bibliographical references (pages 197-204) and index.
1 Introduction: solving the logico-philosophical problem of computability theory --
2 Lambda-calculus: basic concepts, currying, syntax --
3 Lambda-calculus: substitution, reduction, Church-Rosser theorem --
4 Lambda-calculus: outline of the application to computability --
5 Lambda-calculus: all computable functions are lambda-definable --
6 Lambda-calculus: undecidability --
7 The weak call-by-value lambda-calculus and Turing machines --
8 Brief introduction to time complexity
No hay comentarios en este titulo.
Ingresar a su cuenta para colocar un comentario.
Haga clic en una imagen para verla en el visor de imágenes