9780691199665 - a hierarchy of turing degrees: a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability di downey, rod; greenberg, noam (18 risultati)
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: Labyrinth Books, Princeton, NJ, U.S.A.Labyrinth Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 40,87
EUR 3,88 spedizioneSpedito in U.S.A.Quantità: 3 disponibili
Condizione: New.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 82,82
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New. 2020. Paperback. . . . . .
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 95,22
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New.
Lingua: Inglese
Editore: Princeton University Press, US, 2020
- Brossura
Da: Rarewaves USA, HEBRON, KY, U.S.A.Rarewaves USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 98,49
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degr…ees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 94,11
EUR 14,00 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Condizione: New. In English.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 103,32
EUR 9,06 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. 2020. Paperback. . . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 113,12
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 100,83
EUR 17,53 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Condizione: New.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 108,12
EUR 14,72 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Princeton University Press, US, 2020
- Brossura
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 131,72
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degr…ees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 118,95
EUR 17,53 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Princeton University Press, US, 2020
- Brossura
Da: Rarewaves USA United, HEBRON, KY, U.S.A.Rarewaves USA United
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 100,84
EUR 43,15 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degr…ees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Lingua: Inglese
Editore: Princeton Univ Pr, 2020
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 142,54
EUR 11,68 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 222 pages. 9.25x6.25x0.50 inches. In Stock.
Lingua: Inglese
Editore: Princeton University Press, US, 2020
- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 128,52
EUR 75,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degr…ees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Lingua: Inglese
Editore: Princeton Univ Pr, 2020
- Brossura
- Print on Demand
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 107,69
EUR 11,68 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 222 pages. 9.25x6.25x0.50 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: PRINCETON UNIV PR, 2020
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 99,45
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Über den AutorRod Downey and Noam Greenberg are professors of mathematics at Victoria University of Wellington in New Zealand. Downey is the coauthor of Parameterized Complexity, Algorithmic Randomness and Co.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 103,15
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. A Hierarchy of Turing Degrees | A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability | Rod Downey (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2020 | Princeton University Press | EAN 9780691199665 | Verantwortl…iche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Lingua: Inglese
Editore: Princeton University Press, 2020
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 121,65
EUR 61,70 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topolog…y, group theory, and other subfields. In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers. Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
