Computability: An Introduction to Recursive Function Theory
I will be using this book for:

Computability: An Introduction to Recursive Function Theory

by Nigel Cutland

Logic Computability Theory Recursive Functions
1 Star 2 Star 3 Star 4 Star 5 Star
0.0 out of 5 stars (0 ratings)

This book introduces recursive function theory, a cornerstone of computability studies. Nigel Cutland guides readers through the principles that define what machines can and cannot compute, making abstract mathematical concepts clear and engaging for learners in computer science and mathematics.

About This Book

Computability: An Introduction to Recursive Function Theory offers a foundational exploration of key concepts in theoretical computer science.

Authored by Nigel Cutland, the book delves into recursive functions and their role in understanding what can be computed.

It serves as an accessible entry point for students and professionals interested in the limits of computation.

The text emphasizes rigorous yet approachable explanations of complex ideas in recursion and computability.

Reviews

No reviews yet. Be the first to review this book!


Write a Review
I will be using this book for: