Book
Computable Function
Algorithm, Formal language, Church-Turing thesis, List of undecidable problems, Computable number, Effective method, Theory of computation, Computability theory, Turing degree «
Score:
Reviews:
Times tipped:
Times read:
Author(s):
Category:
ISBN
9786130606930
Welcome to Boeklezers.nl
Boeklezers.nl is a network for social reading. We help readers discover new books and authors, and bring readers in contact with each other and with writers. Read more ».
Nobody
Idea box
