A comprehensive introduction to eight major approaches to computation on uncountable mathematical domains.
"synopsis" may belong to another edition of this title.
Noam Greenberg is a Rutherford Discovery Fellow of the Royal Society of New Zealand where his research interests include computability theory, algorithmic randomness, reverse mathematics, higher recursion theory, computable model theory and set theory.
Denis Hirschfeldt is a Professor of Mathematics at the University of Chicago and has previously held visiting positions at the University of Wisconsin, Madison and the University of Notre Dame. He was a recipient of the 2010 Sacks Prize of the Association for Symbolic Logic for expository writing.
Joel David Hamkins is a professor at the City University of New York and has held visiting positions at the University of California, Berkeley, Kobe University, Carnegie Mellon University, the University of Muenster, the University of Amsterdam and New York University.
Russell Miller holds an appointment as Professor of Mathematics jointly between Queens College and the CUNY Graduate Center. His research applies computability to other areas of mathematics, including model theory, set theory, commutative algebra, differential algebra, graph theory and topology.
"About this title" may belong to another edition of this title.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781107014510
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. 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. This book contains introductions to eight major approaches to computable uncountable mathematics: descriptive set theory; infinite time Turing machines; Blum-Shub-Smale computability; Sigma-definability; computability theory on admissible ordinals; E-recursion theory; local computability; and uncountable reverse mathematics. This book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages. It is ideal as both an introductory text for graduate and advanced undergraduate students and a source of interesting new approaches for researchers in computability theory and related areas. This book provides an authoritative and multifaceted introduction to eight major approaches to computation on uncountable mathematical domains. The perspectives explored within reveal different aspects of effective uncountable mathematics, making it an ideal resource for graduate and advanced undergraduate students and researchers in this exciting new area of study. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781107014510
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781107014510
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 205 pages. 9.00x6.00x0.50 inches. In Stock. Seller Inventory # __1107014514
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. 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. This book contains introductions to eight major approaches to computable uncountable mathematics: descriptive set theory; infinite time Turing machines; Blum-Shub-Smale computability; Sigma-definability; computability theory on admissible ordinals; E-recursion theory; local computability; and uncountable reverse mathematics. This book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages. It is ideal as both an introductory text for graduate and advanced undergraduate students and a source of interesting new approaches for researchers in computability theory and related areas. This book provides an authoritative and multifaceted introduction to eight major approaches to computation on uncountable mathematical domains. The perspectives explored within reveal different aspects of effective uncountable mathematics, making it an ideal resource for graduate and advanced undergraduate students and researchers in this exciting new area of study. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781107014510
Seller: AussieBookSeller, Truganina, VIC, Australia
Hardcover. Condition: new. Hardcover. 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. This book contains introductions to eight major approaches to computable uncountable mathematics: descriptive set theory; infinite time Turing machines; Blum-Shub-Smale computability; Sigma-definability; computability theory on admissible ordinals; E-recursion theory; local computability; and uncountable reverse mathematics. This book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages. It is ideal as both an introductory text for graduate and advanced undergraduate students and a source of interesting new approaches for researchers in computability theory and related areas. This book provides an authoritative and multifaceted introduction to eight major approaches to computation on uncountable mathematical domains. The perspectives explored within reveal different aspects of effective uncountable mathematics, making it an ideal resource for graduate and advanced undergraduate students and researchers in this exciting new area of study. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9781107014510