Différences
Ci-dessous, les différences entre deux révisions de la page.
| Les deux révisions précédentes Révision précédente Prochaine révision | Révision précédente Prochaine révision Les deux révisions suivantes | ||
|
fr:research:ploopc [2016/03/23 19:06] apeiron supprimée |
fr:research:ploopc [2016/04/13 17:21] apeiron créée |
||
|---|---|---|---|
| Ligne 1: | Ligne 1: | ||
| FIXME **Cette page n'est pas encore traduite entièrement.** | FIXME **Cette page n'est pas encore traduite entièrement.** | ||
| - | FIXME **This article is a work in progress.** | + | ====== Title ====== |
| - | The article is still in review and the final version of the abstract and the article are not written yet. | + | An Imperative Language Characterizing PTIME Algorithms |
| + | |||
| + | ====== Abstract ====== | ||
| + | |||
| + | Abstract State Machines of Y. Gurevich capture sequential algorithms, so we define the set of PTIME algorithms as the set of ASM programs computed in polynomial time (using timer-step principle). Then, we construct an imperative programming language PLoopC using bounded loop with break, and running with any data structure. Finally, we prove that PLoopC computes exactly PTIME algorithms in lock step (one step of the ASM is simulated by using a constant number of steps). | ||
| + | |||
| + | **Keywords**: ASM, computability, imperative language, implicit complexity, polynomial time, sequential algorithms, simulation. | ||
| + | |||
| + | ====== Links ====== | ||
| + | |||
| + | Here is the {{:en:research:ploopc2.pdf|submitted version}}. | ||