Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
en:research:ploopc [2016/04/04 14:02] apeiron |
en:research:ploopc [2018/02/16 01:25] (current) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | FIXME **This article is a work in progress.** | ||
| - | |||
| ====== Title ====== | ====== Title ====== | ||
| Line 7: | Line 5: | ||
| ====== Abstract ====== | ====== 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). | + | 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. | **Keywords**: ASM, computability, imperative language, implicit complexity, polynomial time, sequential algorithms, simulation. | ||
| Line 13: | Line 11: | ||
| ====== Links ====== | ====== Links ====== | ||
| - | Here is {{:en:research:ploopc1.pdf|the current version}}. | + | Here is the {{:en:research:ploopc2.pdf|submitted version}}. |