Dimiter G. Skordev

Computability in Combinatory Spaces

An Algebraic Generalization of Abstract First Order Computability

• Gebundenes Buch

Produktbeschreibung

This volume provides an account of the current state of the theory of combinatory spaces and discusses various applications. Here the term `combinatory space' can be regarded as a system for functional programming, and bears no close connection with combinatory logic.
The main text is divided into three chapters. Chapter 1 deals with computational structures and computability; Chapter 2 considers combinatory spaces; and Chapter 3 embraces computability in iterative combinatory spaces. A number of appendices treat a survey of examples of combinatory spaces. All sections of the various chapters contain exercices togethers with hints for solution where appropriate.
For the reading of some parts of the book a knowledge of mathematical logic and recursive function theory would be desirable.
For researchers and specialists in mathematical logic and its applications and theoretical computer scientists.

Produktdetails

• Mathematics and Its Applications 55
• Verlag: Springer Netherlands / Springer, Berlin
• 1992.
• Seitenzahl: 342
• Erscheinungstermin: 31. März 1992
• Englisch
• Abmessung: 250mm x 175mm x 24mm
• Gewicht: 760g
• ISBN-13: 9780792315766
• ISBN-10: 0792315766
• Artikelnr.: 26402528

Inhaltsangabe

Preface. I. Computational Structures and Computability on Them. II. Combinatory Spaces. III. Computability in Iterative Combinatory Spaces. Appendix: A Survey of Examples of Combinatory Spaces. References. Additional Bibliography. Index of Names. Index of Definitions.