Hardcover book. The exterior can have some minor wear. All items ship Monday - Saturday - Fast Shipping in a secure package. Your purchase will help support the programs and collections of the Johnson County (Kansas) Library.

Bestandsnummer des Verk�ufers 53DTTR000RMO

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Computability and Complexity: From a Programming Perspective (Foundations of Computing) (FOUNDATIONS OF COMPUTING SERIES)
Verlag: Mit Pr
Erscheinungsjahr: 1997
Sprache: Englisch
ISBN-10: 0262100649
ISBN-13: 9780262100649
Einband: Hardcover
Zustand: VeryGood

�ber diesen Titel

Inhaltsangabe

Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and G�del number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.

According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models.

New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs.

Foundations of Computing series

�ber die Autorin bzw. den Autor

Neil Deaton Jones is a retired Professor of Computer Science at the University of Copenhagen.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

We sell books and AV items withdrawn from the Johnson County (Kansas) Library's collection as well as like items donated to us by the public.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Friends of Johnson County Library
8279 Melrose Dr, Lenexa, KS, 66214, U.S.A.

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Payment must be received prior to shipment of item purchased. Returns must be
authorized by Friends of the Johnson County Library. All payments must be made
in US dollars. Shipment will be made via US Mail within 2 days of purchase.
Advise us if priority shipment required. That can be provided at additional
cost.

Friends of the Johnson County Library
8700 Shawnee Mission parkway
Merriam, KS 66202 USA
jocolibfriends@yahoo.com
(913) 492-4777
Matthew B Delaney - authorized representative

Versandbedingungen

Orders usually ship within 2 business days. Shipping costs are based on books
weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact
you to let you know additional shipping reimbursement is required.