Computability by means of effectively definable schemes and definability via enumerations (Q1263579)
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: Computability by means of effectively definable schemes and definability via enumerations |
scientific article; zbMATH DE number 4127190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computability by means of effectively definable schemes and definability via enumerations |
scientific article; zbMATH DE number 4127190 |
Statements
Computability by means of effectively definable schemes and definability via enumerations (English)
0 references
1990
0 references
In a previous paper the author has characterized, in terms of enumerations, search computability on structures. This paper provides a similar (again in terms of enumerations) characterization of computability via Shepherdson's recursively enumerable definitional schemes.
0 references
enumerations
0 references
characterization of computability via Shepherdson's recursively enumerable definitional schemes
0 references
