fraeon
Films
BrowseTop 250
Series
TV ShowsAnimeTop 250 TVTop 100 Anime
Games
BrowseTop 100
Books
BooksMangaTop 125 BooksTop 100 Manga
For youTrendingTier ListsThe ArchiveLeaderboard
Log inSign up free
fraeon

Everything you watch, play and read — tracked, rated and remembered in one library.

Explore

  • Films
  • TV
  • Anime
  • Games
  • Books
  • Manga

Discover

  • Trending
  • Leaderboard
  • Find people
  • Lists
  • Tier lists

Company

  • Tour
  • About
  • Community guidelines
  • Privacy
  • Terms
  • Contact

© 2026 fraeon. All rights reserved. ·

Metadata from TMDB, RAWG, Jikan & Open Library. This product uses the TMDB API but is not endorsed or certified by TMDB.

Questions or ideas? mehmet@avortas.com

HomeFeedProfile
Computability, an introduction to recursive function theory

Computability, an introduction to recursive function theory

by Nigel Cutland

Computable functionsRecursion theoryBerechenbarkeitRekursionstheorieRecursieve functies
4.0
Open Library
Open Library

About this book

Given a framework capable of calculating, describes methods for determining the framework’s capabilities and limitations.

Themes & subjects

Computable functionsRecursion theoryBerechenbarkeitRekursionstheorieRecursieve functiesRekursive Funktion

Characters & people

Setting

20th century

Author

Nigel Cutland

Pages

251

Read time

≈ 6h

Editions

1

Language

English

Publisher

Cambridge University Press

ISBN

0521223849

Where to buy

TR
Amazon Bookshop

Reviews

No reviews yet — be the first to write one from the Log screen.

Quotes

No quotes yet.

Discussions

Similar books

Computability and logic

Computable functions · Logic, Symbolic and mathematical

Computability and logic

George Boolos

1974

Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit

Algorithms · Computable functions

Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit

Hans Hermes

1961

Discrete structures, logic, and computability

Computable functions · Computer science

Discrete structures, logic, and computability

James L. Hein

1994

Computability and complexity theory

Computational complexity · Computer science

Computability and complexity theory

Steven Homer

2001

Computability & unsolvability

Computable functions · Recursive functions

Computability & unsolvability

Davis, Martin

1958

Theory of recursive functions and effective computability

Computable functions · Recursive functions

Theory of recursive functions and effective computability

Hartley Rogers

1957

Automata and Computability

Machine theory · Computable functions

Automata and Computability

Dexter C. Kozen

2012

Invitation to Applied Category Theory

Categories (mathematics) · Computable functions

Invitation to Applied Category Theory

Brendan Fong

2019

How to Think About Algorithms

Computer Technology · Nonfiction

How to Think About Algorithms

Jeff Edmonds

2008

Fundamentals of mathematical logic

Model theory · Recursion theory

Fundamentals of mathematical logic

Peter G. Hinman

2005

Computability theory

Recursion theory

Computability theory

Herbert B. Enderton

2010

Computability, enumerability, unsolvability

Recursion theory · Recursivité, Théorie de la

Computability, enumerability, unsolvability

S. B. Cooper

1996

Higher recursion theory

Recursion theory

Higher recursion theory

Gerald E. Sacks

1990

Recursion-theoretic hierarchies

Hierarchies · Recursion theory

Recursion-theoretic hierarchies

Peter G. Hinman

1978

Recursive analysis

Recursion theory

Recursive analysis

R. L. Goodstein

2010

Computable Analysis

Recursion theory · Computable functions

Computable Analysis

Klaus Weihrauch

2000

Bounded queries in recursion theory

Computational complexity · Recursion theory

Bounded queries in recursion theory

William I. Gasarch

1998