On the algorithmic undecidability of A-completeness for the boundedly determinate functions (Q2562181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the algorithmic undecidability of A-completeness for the boundedly determinate functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic undecidability of A-completeness for the boundedly determinate functions |
scientific article |
Statements
On the algorithmic undecidability of A-completeness for the boundedly determinate functions (English)
0 references
1972
0 references
