About: Numbering (computability theory)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Numbering (computability theory) Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some formal language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects. Common examples of numberings include Gödel numberings in first-order logic, the description numbers that arise from universal Turing machines and admissible numberings of the set of partial computable functions.

Attributes	Values
rdfs:label	Numbering (computability theory) (en)
rdfs:comment	In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some formal language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects. Common examples of numberings include Gödel numberings in first-order logic, the description numbers that arise from universal Turing machines and admissible numberings of the set of partial computable functions. (en)
sameAs	Numbering (computability theory)
dbp:wikiPageUsesTemplate	dbt:Reflist
Subject	Computability theory Theory of computation
gold:hypernym	Assignment
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Numbering_(computability_theory)?oldid=1037284333&ns=0
Wikipage page ID	2399097 (xsd:integer)
page length (characters) of wiki page	4722 (xsd:nonNegativeInteger)
Wikipage revision ID	1037284333 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal language Admissible numbering Vladimir Andreyevich Uspensky Computability theory Theory of computation Domain of a function Set (mathematics) Surjective function Cylindrification Preorder Complete numbering Computability theory Computable function Computably enumerable Partial function First-order logic Friedberg numbering Function (mathematics) Graph Gödel numbering Yury Yershov History of numbers Rational number
has abstract	In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some formal language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects. Common examples of numberings include Gödel numberings in first-order logic, the description numbers that arise from universal Turing machines and admissible numberings of the set of partial computable functions. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Numbering_(computability_theory)
is Wikipage redirect of	Comparision of numberings Effective numbering Reducibility (numbering) Equivalent (numbering) One equivalent numbering Total numbering
is Link from a Wikipage to another Wikipage of	Numbering scheme Admissible numbering Blum axioms Myhill isomorphism theorem Cylindric numbering Cylindrification Comparision of numberings Complete numbering Computable isomorphism Choice sequence Friedberg numbering Effective numbering Equivalent (numbering)

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software