Cargando…
Algebraic computability and enumeration models: recursion theory and descriptive complexity
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories an...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Apple Academic Press
2016
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2622823 |