Matches in SemOpenAlex for { <https://semopenalex.org/work/W4376312568> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W4376312568 abstract "Partiality is a natural phenomenon in computability that we cannot get around, So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens more structure. In this paper we consider function classes which besides the total functions only contain finite functions whose domain of definition is an initial segment of the natural numbers. Such functions appear naturally in computation. We show that a rich computability theory can be developed for these functions classes which embraces the central results of classical computability theory, in which all partial (computable) functions are considered. To do so the concept of a Godel number is generalised, resulting in a broader class of numberings. The central algorithmic idea in this approach is to search in enumerated lists. By this way the notion of computation is reduced to that of enumeration. Beside of the development of a computability theory for the functions classes, the new numberings -- called quasi-Godel numberings -- are studied from a numbering-theoretic perspective: they are complete, and each of the function classes numbered in this way is a retract of the Godel numbered set of all partial computable functions. Moreover, the Rogers semi-lattice of all computable numberings of the considered function classes is studied and results as in the case of the computable numberings of the partial computable functions are obtained. The function classes are shown to be effectively given algebraic domains in the sense of Scott-Ershov. The quasi-Godel numberings are exactly the admissible numberings of the domain. Moreover, the domain can be computable mapped onto every other effectively given one so that every admissible numbering of the computable domain elements is generated by a quasi-Godel numbering via this mapping." @default.
- W4376312568 created "2023-05-13" @default.
- W4376312568 creator A5005352054 @default.
- W4376312568 date "2023-05-11" @default.
- W4376312568 modified "2023-10-01" @default.
- W4376312568 title "How Much Partiality Is Needed for a Theory of Computability?" @default.
- W4376312568 doi "https://doi.org/10.48550/arxiv.2305.06982" @default.
- W4376312568 hasPublicationYear "2023" @default.
- W4376312568 type Work @default.
- W4376312568 citedByCount "0" @default.
- W4376312568 crossrefType "posted-content" @default.
- W4376312568 hasAuthorship W4376312568A5005352054 @default.
- W4376312568 hasBestOaLocation W43763125681 @default.
- W4376312568 hasConcept C111142201 @default.
- W4376312568 hasConcept C11413529 @default.
- W4376312568 hasConcept C118615104 @default.
- W4376312568 hasConcept C136119220 @default.
- W4376312568 hasConcept C14036430 @default.
- W4376312568 hasConcept C152062344 @default.
- W4376312568 hasConcept C154945302 @default.
- W4376312568 hasConcept C191916993 @default.
- W4376312568 hasConcept C202444582 @default.
- W4376312568 hasConcept C27318111 @default.
- W4376312568 hasConcept C2777212361 @default.
- W4376312568 hasConcept C33923547 @default.
- W4376312568 hasConcept C41008148 @default.
- W4376312568 hasConcept C54271186 @default.
- W4376312568 hasConcept C78458016 @default.
- W4376312568 hasConcept C86803240 @default.
- W4376312568 hasConceptScore W4376312568C111142201 @default.
- W4376312568 hasConceptScore W4376312568C11413529 @default.
- W4376312568 hasConceptScore W4376312568C118615104 @default.
- W4376312568 hasConceptScore W4376312568C136119220 @default.
- W4376312568 hasConceptScore W4376312568C14036430 @default.
- W4376312568 hasConceptScore W4376312568C152062344 @default.
- W4376312568 hasConceptScore W4376312568C154945302 @default.
- W4376312568 hasConceptScore W4376312568C191916993 @default.
- W4376312568 hasConceptScore W4376312568C202444582 @default.
- W4376312568 hasConceptScore W4376312568C27318111 @default.
- W4376312568 hasConceptScore W4376312568C2777212361 @default.
- W4376312568 hasConceptScore W4376312568C33923547 @default.
- W4376312568 hasConceptScore W4376312568C41008148 @default.
- W4376312568 hasConceptScore W4376312568C54271186 @default.
- W4376312568 hasConceptScore W4376312568C78458016 @default.
- W4376312568 hasConceptScore W4376312568C86803240 @default.
- W4376312568 hasLocation W43763125681 @default.
- W4376312568 hasOpenAccess W4376312568 @default.
- W4376312568 hasPrimaryLocation W43763125681 @default.
- W4376312568 hasRelatedWork W1480530468 @default.
- W4376312568 hasRelatedWork W2078849804 @default.
- W4376312568 hasRelatedWork W2118835180 @default.
- W4376312568 hasRelatedWork W2171088343 @default.
- W4376312568 hasRelatedWork W2480451440 @default.
- W4376312568 hasRelatedWork W3134034528 @default.
- W4376312568 hasRelatedWork W3184399009 @default.
- W4376312568 hasRelatedWork W4236179144 @default.
- W4376312568 hasRelatedWork W4251066371 @default.
- W4376312568 hasRelatedWork W4286434485 @default.
- W4376312568 isParatext "false" @default.
- W4376312568 isRetracted "false" @default.
- W4376312568 workType "article" @default.