Equivalence of partial recursivity and computability by algorithms without concluding formulas (Q2553960)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of partial recursivity and computability by algorithms without concluding formulas |
scientific article |
Statements
Equivalence of partial recursivity and computability by algorithms without concluding formulas (English)
0 references
1972
0 references
