Generic complexity of undecidable problems (Q3503760): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:00, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generic complexity of undecidable problems |
scientific article |
Statements
Generic complexity of undecidable problems (English)
0 references
9 June 2008
0 references
strong undecidability
0 references
Rice theorem
0 references
super-undecidable problems
0 references
finitely presented semigroups
0 references
word problem
0 references
generic amplification
0 references
absolutely undecidable problems
0 references
generic immune sets
0 references
