feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Amsterdam ; New York : Elsevier
    UID:
    b3kat_BV036962249
    Format: 1 Online-Ressource (xii, 727 p.) , ill , 23 cm
    Edition: 1st ed
    Edition: Online-Ausgabe Elsevier e-book collection on ScienceDirect Sonstige Standardnummer des Gesamttitels: 041169-3
    ISBN: 0444898824 , 9780444898821
    Series Statement: Studies in logic and the foundations of mathematics v. 140
    Note: Includes bibliographical references and indexes
    Additional Edition: Reproduktion von Handbook of computability theory 1999
    Language: English
    Subjects: Computer Science , Mathematics , Philosophy
    RVK:
    RVK:
    RVK:
    RVK:
    RVK:
    Keywords: Rekursionstheorie ; Berechenbarkeit ; Rekursive Funktion ; Mathematische Logik ; Zahlentheorie ; Berechenbarkeit ; Berechnungstheorie ; Aufsatzsammlung
    URL: Volltext  (Deutschlandweit zugänglich)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almafu_BV009817807
    Format: XII, 349 S. : graph. Darst.
    Edition: 1. publ.
    ISBN: 0-521-38344-7
    Series Statement: Cambridge tracts in theoretical computer science 22
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    Keywords: Topologie ; Bereichstheorie ; Mathematik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Amsterdam ; : Elsevier,
    UID:
    almahu_9949697486902882
    Format: 1 online resource (741 p.)
    Edition: 1st ed.
    ISBN: 1-281-02904-1 , 9786611029043 , 0-08-053304-3
    Series Statement: Studies in logic and the foundations of mathematics ; v. 140
    Content: The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation i
    Note: Description based upon print version of record. , Front Cover; Handbook of Computability Theory; Copyright Page; Preface; List of Contributors; Contents; Part 1: Fundamentals of Computability Theory; Chapter 1. The history and concept of computability; Chapter 2. π01 classes in recursion theory; Part 2: Reducibilities and Degrees; Chapter 3. Reducibilities; Chapter 4. Local degree theory; Chapter 5. The global structure of the Turing degrees; Chapter 6. The recursively enumerable degrees; Chapter 7. An overview of the computably enumerable sets; Part 3: Generalized Computability Theory; Chapter 8. The continuous functionals , Chapter 9. Ordinal recursion theoryChapter 10. E-recursion; Chapter 11. Recursion on abstract structures; Part 4: Mathematics and Computability Theory; Chapter 12. Computable rings and fields; Chapter 13. The structure of computability in analysis and physical theory: An extension of Church's thesis; Chapter 14. Theory of numberings; Part 5: Logic and Computability Theory; Chapter 15. Pure recursive model theory; Chapter 16. Classifying recursive functions; Part 6: Computer Science and Computability Theory; Chapter 17. Computation models and function algebras , Chapter 18. Polynomial time reducibilities and degreesAuthor Index; Subject Index , English
    Additional Edition: ISBN 0-444-89882-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almahu_9948233787402882
    Format: 1 online resource (xii, 349 pages) : , digital, PDF file(s).
    ISBN: 9781139166386 (ebook)
    Series Statement: Cambridge tracts in theoretical computer science ; 22
    Content: Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the subject. The theory is presented in a mathematically precise manner which nevertheless is accessible to mathematicians and computer scientists alike. The authors begin with the basic theory including domain equations, various domain representations and universal domains. They then proceed to more specialized topics such as effective and power domains, models of lambda-calculus and so on. In particular, the connections with ultrametric spaces and the Kleene-Kreisel continuous functionals are made precise. Consequently the text will be useful as an introductory textbook (earlier versions have been class-tested in Uppsala, Gothenburg, Passau, Munich and Swansea), or as a general reference for professionals in computer science and logic.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015).
    Additional Edition: Print version: ISBN 9780521383448
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Amsterdam ; : Elsevier,
    UID:
    almafu_9958115525002883
    Format: 1 online resource (741 p.)
    Edition: 1st ed.
    ISBN: 1-281-02904-1 , 9786611029043 , 0-08-053304-3
    Series Statement: Studies in logic and the foundations of mathematics ; v. 140
    Content: The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation i
    Note: Description based upon print version of record. , Front Cover; Handbook of Computability Theory; Copyright Page; Preface; List of Contributors; Contents; Part 1: Fundamentals of Computability Theory; Chapter 1. The history and concept of computability; Chapter 2. π01 classes in recursion theory; Part 2: Reducibilities and Degrees; Chapter 3. Reducibilities; Chapter 4. Local degree theory; Chapter 5. The global structure of the Turing degrees; Chapter 6. The recursively enumerable degrees; Chapter 7. An overview of the computably enumerable sets; Part 3: Generalized Computability Theory; Chapter 8. The continuous functionals , Chapter 9. Ordinal recursion theoryChapter 10. E-recursion; Chapter 11. Recursion on abstract structures; Part 4: Mathematics and Computability Theory; Chapter 12. Computable rings and fields; Chapter 13. The structure of computability in analysis and physical theory: An extension of Church's thesis; Chapter 14. Theory of numberings; Part 5: Logic and Computability Theory; Chapter 15. Pure recursive model theory; Chapter 16. Classifying recursive functions; Part 6: Computer Science and Computability Theory; Chapter 17. Computation models and function algebras , Chapter 18. Polynomial time reducibilities and degreesAuthor Index; Subject Index , English
    Additional Edition: ISBN 0-444-89882-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    b3kat_BV043970545
    Format: 1 online resource (xxvi, 273 pages) , illustrations
    ISBN: 9780128038383 , 0128038381 , 9780128037737
    Series Statement: Syngress advanced topics in information security
    Note: Description based on online resource; title from title page (Safari, viewed November 10, 2016)
    Language: English
    Keywords: Rechnernetz ; Computersicherheit ; Datensicherung ; Unternehmen ; Datensicherung ; Informationssystem
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    gbv_883332396
    Format: 1 Online-Ressource (xii, 349 pages) , digital, PDF file(s)
    ISBN: 9781139166386
    Series Statement: Cambridge tracts in theoretical computer science 22
    Content: Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the subject. The theory is presented in a mathematically precise manner which nevertheless is accessible to mathematicians and computer scientists alike. The authors begin with the basic theory including domain equations, various domain representations and universal domains. They then proceed to more specialized topics such as effective and power domains, models of lambda-calculus and so on. In particular, the connections with ultrametric spaces and the Kleene–Kreisel continuous functionals are made precise. Consequently the text will be useful as an introductory textbook (earlier versions have been class-tested in Uppsala, Gothenburg, Passau, Munich and Swansea), or as a general reference for professionals in computer science and logic
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015)
    Additional Edition: ISBN 9780521383448
    Additional Edition: ISBN 9780521064798
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9780521383448
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Book
    Book
    Amsterdam [u.a.] :Elsevier,
    UID:
    almafu_BV012992603
    Format: XII, 727 S.
    Edition: 1. ed.
    ISBN: 0-444-89882-4
    Series Statement: Studies in logic and the foundations of mathematics 140
    Language: English
    Subjects: Computer Science , Mathematics , Philosophy
    RVK:
    RVK:
    RVK:
    RVK:
    RVK:
    Keywords: Rekursionstheorie ; Berechenbarkeit ; Rekursive Funktion ; Mathematische Logik ; Zahlentheorie ; Berechenbarkeit ; Berechnungstheorie
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almafu_9960119304102883
    Format: 1 online resource (xii, 349 pages) : , digital, PDF file(s).
    ISBN: 1-139-16638-7
    Series Statement: Cambridge tracts in theoretical computer science ; 22
    Content: Domain theory is an established part of theoretical computer science, used in giving semantics to programming languages and logics. In mathematics and logic it has also proved to be useful in the study of algorithms. This book is devoted to providing a unified and self-contained treatment of the subject. The theory is presented in a mathematically precise manner which nevertheless is accessible to mathematicians and computer scientists alike. The authors begin with the basic theory including domain equations, various domain representations and universal domains. They then proceed to more specialized topics such as effective and power domains, models of lambda-calculus and so on. In particular, the connections with ultrametric spaces and the Kleene-Kreisel continuous functionals are made precise. Consequently the text will be useful as an introductory textbook (earlier versions have been class-tested in Uppsala, Gothenburg, Passau, Munich and Swansea), or as a general reference for professionals in computer science and logic.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , English
    Additional Edition: ISBN 0-521-06479-1
    Additional Edition: ISBN 0-521-38344-7
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages