Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

by S.R. Buss, P.J. Scott

Paperback(1990)

$99.00
Use Standard Shipping. For guaranteed delivery by December 24, use Express or Expedited Shipping.

Product Details

ISBN-13: 9780817634834
Publisher: Birkhäuser Boston
Publication date: 01/01/1990
Series: Progress in Computer Science and Applied Logic , #9
Edition description: 1990
Pages: 352
Product dimensions: 5.98(w) x 9.02(h) x 0.03(d)

Table of Contents

Parity and the Pigeonhole Principle.- Computing over the Reals (or an Arbitrary Ring) Abstract.- On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results.- Sequential, Machine Independent Characterizations of the Parallel Complexity Classes AlogTIME, ACk NCk and NC.- Characterizations of the Basic Feasible Functionals of Finite Type.- Functional Interpretations of Feasibly Constructive Arithmetic — Abstract.- Polynomial-time Combinatorial Operators are Polynomials.- Isols and Kneser Graphs.- Stockmeyer Induction.- Probabilities of Sentences about Two Linear Orderings.- Bounded Linear Logic: a Modular Approach to Polynomial Time Computability, Extended Abstract.- On Finite Model Theory (Extended Abstract).- Computational Models for Feasible Real Analysis.- Inverting a One-to-One Real Function is Inherently Sequential.- On Bounded ?11 Polynomial Induction.- Subrecursion and Lambda Representation over Free Algebras (Preliminary Summary).- Complexity-Theoretic Algebra: Vector Space Bases.- When is every Recursive Linear Ordering of Type ? Recursively Isomorphic to a Polynomial Time Linear Ordering over the Natural Numbers in Binary Form?.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews