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

By: Dimiter G. Skordev

Write A Review

Hardcover

At a Glance

Hardcover
342 Pages

Dimensions(cm)
23.0 x 16.99 x 2.06

Hardcover

$179.00

or 4 interest-free payments of $44.75 with

or

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.