ISBN: 9780817634834 - feasible mathematics: "a mathematical sciences institute workshop, ithaca, new york, june 1989": 9 (19 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.…

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.…

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: New.

Condizione: As New. Unread book in perfect condition.

Condizione: Used. pp. 364.

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

Condizione: New. In English.

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

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

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

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.…

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

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.

PF. Condizione: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 364 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 executi.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 364 pp. Englisch.…