An arithmetic for polynomial-time computation (Q2500489)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An arithmetic for polynomial-time computation |
scientific article; zbMATH DE number 5047258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An arithmetic for polynomial-time computation |
scientific article; zbMATH DE number 5047258 |
Statements
An arithmetic for polynomial-time computation (English)
0 references
16 August 2006
0 references
Constructive proofs theoretically allow for the extraction of correct programs for specifications. This paper is concerned with the feasibility of such methodology. The author defines a restriction of Heyting arithmetic which has the property that all extracted codes are efficient. These restrictions concern the ranges of the terms and the like.
0 references
polynomial-time
0 references
linear Heyting arithmetic
0 references
ramification
0 references
0.8018361330032349
0 references
0.7852858901023865
0 references
0.7831095457077026
0 references
0.769657552242279
0 references
