Equivalence of partial recursivity and computability by algorithms without concluding formulas (Q2553960)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3382328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence of partial recursivity and computability by algorithms without concluding formulas |
scientific article; zbMATH DE number 3382328 |
Statements
Equivalence of partial recursivity and computability by algorithms without concluding formulas (English)
0 references
1972
0 references
