Feasible mathematics (47 risultati)

Hardcover. Condizione: Good. 1st Edition. Library-discharged hardcover with typical library markings (lower spine, page edges, inside front and back covers, upper corners of the first few endpapers, copyright and preface pages). Absent these markings, this book would be excellent with slight handling. 350 pages, text entirely unmarked. [1.4 lbs]. Book.…

Hardcover. 350pp. Some neat highlighting on 3 pages, otherwise VG+ condition.

Hard Cover. Condizione: Fine. Condizione sovraccoperta: No Dust Jacket Present. 350 pages. "This book includes both the sudy of feasible compuation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation." FINE HARDCOVER. Size: 8vo - over 7¾" - 9¾" tall.…

Softcover. Condizione: GOOD. First Edition. 1978. Vintage / Collectable Computer Science. PBK. Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30). Society for Industrial and Applied Mathematics. Previous owner's name on title page. Text / formulas appear to be unmarked, no highlighting, underlining or writing. Softcover shows rubbing, corner creasing to back cover and some pages, edge and shelf wear from normal use. Binding is solid, square. Photos are of actual book you will receive. Ships quickly and with care. _____________________________________________________________________________________________________________________________ SYNOPSIS & HISTORY: An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.…

Condizione: New.

Condizione: Used. pp. 364.

Condizione: Used. pp. 364 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.

Condizione: Used. pp. 364.

Condizione: As New. Unread book in perfect condition.

Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

PF. Condizione: New.

Hardcover. Condizione: Very Good.

Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New. 1990. Paperback. . . . . .

Condizione: New. 2011. Paperback. . . . . .

Condizione: Used. pp. 447 1st Edition, Reprint.

Condizione: Used. pp. 447.

Condizione: Used. pp. 447.

Condizione: New. pp. 460.

Hardcover. Condizione: Brand New. 350 pages. 9.50x6.50x1.00 inches. In Stock.

Condizione: New. 1990. Paperback. . . . . . Books ship from the US and Ireland.

Condizione: New. 2011. Paperback. . . . . . Books ship from the US and Ireland.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa tion device, such as a 'lUring machine or boolean circuit. Feasible math ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.…

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - A so-called 'effective' algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A 'feasible' algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions of complexity classes, on finite model theory, on models of feasible computation for real numbers, on vector spaces and on recursion theory. The vVorkshop on Feasible Mathematics was sponsored by the Mathematical Sciences Institute and was held at Cornell University, June 26-28, 1989.…

Hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: New. Satisfaction Guaranteed or your money back.

Condizione: New. In English.