About: Computability theory

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

About: Computability theory Goto Sponge NotDistinct Permalink

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

Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory. Basic questions addressed by computability theory include:

Attributes	Values
rdf:type	organisation
rdfs:label	Computability theory (en)
rdfs:comment	Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory. Basic questions addressed by computability theory include: (en)
sameAs	Computability theory Computability theory
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Cite_web dbt:Color dbt:Commonscat dbt:For dbt:Further dbt:Main dbt:Portal dbt:Reflist dbt:Short_description dbt:Val dbt:Harvnb dbt:Harvid dbt:Computer_science dbt:Mathematical_logic dbt:COther
Subject	Computability theory Mathematical logic
Link from a Wikipage to an external page	https://archive.org/details/handbookofmathem0090unse https://web.archive.org/web/20090125120159/http:/www.isrl.uiuc.edu/~amag/langev/paper/gold67limit.html https://web.archive.org/web/20130420184948/http:/www.cs.umb.edu/~fejer/articles/History_of_Degrees.pdf http://www.math.cornell.edu/~shore/papers/pdf/jumpmrl.pdf http://www.aslonline.org/ http://www.cs.umb.edu/~fejer/articles/History_of_Degrees.pdf http://www.maths.leeds.ac.uk/cie/ http://www.people.cs.uchicago.edu/~soare/History/compute.pdf%7Cjstor=420992 https://archive.org/details/classicalrecursi0000odif https://archive.org/details/computabilityint0000cutl https://archive.org/details/handbookofmathem0090unse/page/527 https://archive.org/details/higherrecursiont0000sack https://books.google.com/books%3Fid=MfTMDeCq7ukC&pg=PA149 https://books.google.com/books%3Fid=qW8x7sQ4JXgC http://web.mit.edu/~6.863/www/spring2009/readings/gold67limit.pdf http://www.comp.nus.edu.sg/~fstephan/learning.ps http://www.comp.nus.edu.sg/~fstephan/recursiontheory.html http://web.comlab.ox.ac.uk/oucl/research/areas/ieg/e-library/sources/tp2-ie.pdf
gold:hypernym	Branch
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Computability_theory?oldid=1059653421&ns=0
Wikipage page ID	155414 (xsd:integer)
page length (characters) of wiki page	48362 (xsd:nonNegativeInteger)
Wikipage revision ID	1059653421 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal language Formal methods Group (mathematics) List of undecidable problems Proof theory Uncountable set William Boone (mathematician) Ackermann function Admissible numbering Alan Turing Alfred Tarski Algorithm Algorithmically random sequence Alonzo Church Analog computer Analog signal processing Analogue electronics Analytical hierarchy Andrey Markov Jr. Arithmetical hierarchy Association for Symbolic Logic Bijection Semi-Thue system Semi-membership Stephen Cole Kleene Tarski's undefinability theorem Turing degree Turing jump Turing machine Turing reduction Universal Turing machine Busy beaver Cantor's theorem Cantor space Computability theory General recursive function Julia Robinson Mathematical logic Differential equation Diophantine equation Diophantine set Hilbert's tenth problem Kurt Gödel Post's theorem Power set Pyotr Novikov Second-order arithmetic Set theory Word problem for groups Church–Turing thesis Definable set Hyperarithmetical theory Primitive recursive arithmetic

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 (71 GB total memory, 1013 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software