Computability in Combinatory Spaces

Computability in Combinatory Spaces : An Algebraic Generalization of Abstract First Order Computability

3 (1 rating by Goodreads)
By (author) 

List price: US$139.99

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


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 chapter 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 treats a survey of examples of combinatory spaces. All sections of the chapters contain exercises together 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. The text is mainly aimed at researchers and specialists of mathematical logic and its applications, as well as theoretical computer scientists.
show more

Product details

  • Hardback | 336 pages
  • 162.56 x 233.68 x 27.94mm | 748.42g
  • Dordrecht, Netherlands, United States
  • English
  • Subsequent
  • indices, bibliography
  • 0792315766
  • 9780792315766

Table of contents

Computational structures and computability on them; combinatory spaces; computability in iterative combinatory spaces. Appendix: A survey of examples of combinatory spaces.
show more

Rating details

1 ratings
3 out of 5 stars
5 0% (0)
4 0% (0)
3 100% (1)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X