View in EDS PDF Full Text

Abstract Recursion and Intrinsic Complexity

Saved in:
Bibliographic Details
Title: Abstract Recursion and Intrinsic Complexity
Description: This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.
Authors: Yiannis N. Moschovakis
Resource Type: eBook.
Subjects: Set theory, Algorithms, Recursion theory
Categories: MATHEMATICS / Logic
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 1948869
RelevancyScore: 1090
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1090.09973144531
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$1948869$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$1948869$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Abstract Recursion and Intrinsic Complexity
– Name: Abstract
  Label: Description
  Group: Ab
  Data: This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Yiannis+N%2E+Moschovakis%22">Yiannis N. Moschovakis</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Set+theory%22">Set theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Recursion+theory%22">Recursion theory</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Logic%22">MATHEMATICS / Logic</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=1948869
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 518.1
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Set theory
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Recursion theory
        Type: general
    Titles:
      – TitleFull: Abstract Recursion and Intrinsic Complexity
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Yiannis N. Moschovakis
      – PersonEntity:
          Name:
            NameFull: Yiannis N. Moschovakis
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2019
            – D: 04
              M: 01
              Type: profile
              Y: 2019
          Identifiers:
            – Type: isbn-print
              Value: 9781108415583
            – Type: isbn-electronic
              Value: 9781108246491
          Numbering:
            – Type: volume
              Value: 00048
          Titles:
            – TitleFull: Abstract Recursion and Intrinsic Complexity
              Type: main
ResultId 1