Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (Q2253865)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP |
scientific article |
Statements
Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (English)
0 references
13 February 2015
0 references
Turing machine
0 references
function-oracle Turing machine
0 references
class FP
0 references
