Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Bøger
Bestsellers
Kommer snart
Nyheder
Spil og hobby
Hjem
Kategorier
Bestsellers
Kommer snart
Nyheder
FAQ
Konto
Kontakt
Kurv
  1. Bog
  2. Matematikkens fundament
  3. Matematisk logik

A Hierarchy of Turing Degrees

- A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Af: Noam Greenberg, Rod Downey Engelsk Paperback

A Hierarchy of Turing Degrees

- A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability
Af: Noam Greenberg, Rod Downey Engelsk Paperback
Tjek vores konkurrenters priser

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 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.

Vis mere
Tjek vores konkurrenters priser
Normalpris
kr 764
Fragt: 39 kr
6 - 8 hverdage
20 kr
Pakkegebyr
God 4 anmeldelser på
Tjek vores konkurrenters priser

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 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.

Vis mere
Se mere i:
Produktdetaljer
Sprog: Engelsk
Sider: 234
ISBN-13: 9780691199665
Indbinding: Paperback
Udgave:
ISBN-10: 0691199663
Kategori: Matematisk logik
Udg. Dato: 16 jun 2020
Længde: 17mm
Bredde: 234mm
Højde: 156mm
Forlag: Princeton University Press
Oplagsdato: 16 jun 2020
Forfatter(e): Noam Greenberg, Rod Downey
Forfatter(e) Noam Greenberg, Rod Downey

Kategori Matematisk logik

ISBN-13 9780691199665

Sprog Engelsk

Indbinding Paperback

Sider 234

Udgave

Længde 17mm

Bredde 234mm

Højde 156mm

Udg. Dato 16 jun 2020

Oplagsdato 16 jun 2020

Forlag Princeton University Press

Kategori sammenhænge