Computability theory. Abstracts from the workshop held February 5--11, 2012. (Q343320)
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 theory. Abstracts from the workshop held February 5--11, 2012. |
scientific article; zbMATH DE number 6656811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computability theory. Abstracts from the workshop held February 5--11, 2012. |
scientific article; zbMATH DE number 6656811 |
Statements
Computability theory. Abstracts from the workshop held February 5--11, 2012. (English)
0 references
27 November 2016
0 references
Summary: Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel's Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science.
0 references
0.8397799134254456
0 references
0.7873464822769165
0 references
0.7749168872833252
0 references
