Feasible arithmetic computations: Valiant's hypothesis
نویسندگان
چکیده
منابع مشابه
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational information about the theorem being proved. This includes extracting feasible algorithms, deterministic or interactive, for witnessing an existential quantifier, a uniform family of short propositional proofs of instance...
متن کاملA New "Feasible" Arithmetic
A classical quantified modal logic is used to define a “feasible” arithmetic A2 whose provable functions are exactly the polynomial-time computable functions. Informally, one understands α as “α is feasibly demonstrable”. A2 differs from a system A2 that is as powerful as Peano Arithmetic only by the restriction of induction to ontic (i.e. -free) formulas. Thus, A2 is defined without any refere...
متن کاملArithmetic Issues in Geometric Computations
This paper rst recalls by some examples the damages that the numerical inaccuracy of the oating-point arithmetic can cause during geometric computations, and it intends to explain why damages for geometric computations diier from those met in numerical computations. Then it surveys the various approaches proposed to overcome inaccuracy diiculties; conservative approaches use classical geometric...
متن کاملConsistency proof of a feasible arithmetic inside a bounded arithmetic
Ever since Buss showed the relation of his hierarchy of bounded arithmetic S 2, i = 1, 2, . . . to polynomial-time hierarchy of computational complexity [2], the question of whether his hierarchy is collapsed at some i = n or not, has become one of the central questions of bounded arithmetic. This is because the collapse of Buss’s hierarchy implies the collapse of polynomial-time hierarchy. In ...
متن کاملAbstract: Empirically Feasible Epistemology of Arithmetic
Empirically Feasible Epistemology of
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1987
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(87)80063-9