Theory and Applications of Computability- Computable Structure Theory

This is the first book which gives a unified theory for countable and uncountable computable structures.

The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profinite groups, and the like.

This is the first book which gives a unified theory for countable and uncountable computable structures.

The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profinite groups, and the like. Further, it provides the first account of these that exploits effective versions of dualities, such as Stone and Pontryagin dualities. The themes are effective classification and enumeration.

Topics and features:

· Delivers a self-contained, gentle introduction to priority arguments, directly applying them in algebraic contexts

· Includes extensive exercises that both cement and amplify the materials

· Provides complete introduction to the basics of computable analysis, particularly in the context of computable structures

· Offers the first monograph treatment of computable Polish groups, effective profinite groups via Stone duality, and effective abelian groups via Pontryagin duality

· Presents the first book treatment of Friedberg enumerations of structures

This unique volume is aimed at graduate students and researchers in computability theory, as well as mathematicians seeking to understand the algorithmic content of structure theory. Being self-contained, it provides ample opportunity for self-study.

This is the first book which gives a unified theory for countable and uncountable computable structures.

The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profinite groups, and the like. Further, it provides the first account of these that exploits effective versions of dualities, such as Stone and Pontryagin dualities. The themes are effective classification and enumeration.

Topics and features:

· Delivers a self-contained, gentle introduction to priority arguments, directly applying them in algebraic contexts

· Includes extensive exercises that both cement and amplify the materials

· Provides complete introduction to the basics of computable analysis, particularly in the context of computable structures

· Offers the first monograph treatment of computable Polish groups, effective profinite groups via Stone duality, and effective abelian groups via Pontryagin duality

· Presents the first book treatment of Friedberg enumerations of structures

This unique volume is aimed at graduate students and researchers in computability theory, as well as mathematicians seeking to understand the algorithmic content of structure theory. Being self-contained, it provides ample opportunity for self-study.