
Aspects of Computation and Automata Theory with Applications
Noam Greenberg, Sanjay Jain, Keng Meng Ng
₹4,327

by Noam Greenberg, Denis Hirschfeldt, Joel David Hamkins
Free delivery. Nothing extra to pay at checkout.
Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods - some old, some new - that have extended its basic concepts to uncountable structures. Unlike in the classical case, however, no single dominant approach has emerged, and different methods reveal different aspects of the computable content of uncountable mathematics.
Description supplied by the publisher.