National Science Library of Georgia

Abstract recursion and intrinsic complexity / (Record no. 514615)

MARC details
000 -LEADER
fixed length control field 02199nam a22003498i 4500
001 - CONTROL NUMBER
control field CR9781108234238
003 - CONTROL NUMBER IDENTIFIER
control field UkCbUP
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200124160158.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION
fixed length control field m|||||o||d||||||||
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr||||||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 161129s2019||||enk o ||1 0|eng|d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781108234238 (ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 9781108415583 (hardback)
040 ## - CATALOGING SOURCE
Original cataloging agency UkCbUP
Language of cataloging eng
Description conventions rda
Transcribing agency UkCbUP
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA9.6
Item number .M67 2019
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.3
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Moschovakis, Yiannis N.,
Relator term author.
245 10 - TITLE STATEMENT
Title Abstract recursion and intrinsic complexity /
Statement of responsibility, etc Yiannis N. Moschovakis.
264 #1 - Production, Publication, Distribution, Manufacture, and Copyright Notice (R)
Place of production, publication, distribution, manufacture (R) Cambridge :
Name of producer, publisher, distributor, manufacturer (R) Cambridge University Press,
Date of production, publication, distribution, manufacture, or copyright notice 2019.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (vii, 243 pages) :
Other physical details digital, PDF file(s).
336 ## - Content Type (R)
Content type term (R) text
Content type code (R) txt
Source (NR) rdacontent
337 ## - Media Type (R)
Media type term (R) computer
Media type code (R) c
Source (NR) rdamedia
338 ## - Carrier Type (R)
Carrier type term (R) online resource
Carrier type code (R) cr
Source (NR) rdacarrier
490 1# - SERIES STATEMENT
სერიის ცნობა Lecture notes in logic ;
Volume number/sequential designation 48
500 ## - GENERAL NOTE
General note Title from publisher's bibliographic system (viewed on 15 Nov 2018).
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Recursion theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Induction (Mathematics)
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Print version:
International Standard Book Number 9781108415583
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture notes in logic ;
Volume number/sequential designation 48.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1017/9781108234238">https://doi.org/10.1017/9781108234238</a>

No items available.

Copyright © 2023 Sciencelib.ge All rights reserved.