Jump to content

Information for "Basis theorem (computability)"

Basic information

Display titleBasis theorem (computability)
Default sort keyBasis theorem (computability)
Page length (in bytes)4,255
Namespace ID0
Page ID53605449
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of page watchersFewer than 30 watchers
Number of redirects to this page0
Counted as a content pageYes
Wikidata item IDQ30716971
Central descriptionmathematical theorem in computability theory, that particular kinds of sets always must have some members that are, in terms of Turing degree, not too complicated
Page views in the past 30 days

Page protection

EditAllow all users (no expiry set)
MoveAllow all users (no expiry set)
View the protection log for this page.

Edit history

Page creatorCBM (talk | contribs)
Date of page creation22:04, 26 March 2017
Latest editorJohn of Reading (talk | contribs)
Date of latest edit08:38, 4 July 2024
Total number of edits17
Recent number of edits (within past 30 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (11)

Pages transcluded onto the current version of this page (help):

Wikidata entities used in this page

External tools