Computability, Enumerability, Unsolvability by

Computability, Enumerability, Unsolvability

London Mathematical Society Lecture Note

356 pages missing pub info (editions)

nonfiction mathematics
Powered by AI (Beta)
Loading...

Description

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book provide a picture of current ideas and methods in the ongoing inv...

Read more

Community Reviews

Loading...

Content Warnings

Loading...