Computability in Combinatory Spaces: An Algebraic Generalization of Abstract First Order Computability (Mathematics and its Appl,Used

Computability in Combinatory Spaces: An Algebraic Generalization of Abstract First Order Computability (Mathematics and its Appl,Used

In Stock
SKU: DADAX9401051658
UPC: 9799401051650
Brand: Springer
Condition: New
$76.41
Free Standard Shipping Across USA
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 3–5 business days
  • Estimated Delivery: 6–10 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed