On the strongly generic undecidability of the halting problem (Q884482): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983360706 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MULTIPLICATIVE MEASURES ON FREE GROUPS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The halting problem is decidable on a set of asymptotic probability one / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generic-case complexity, decision problems in group theory, and random walks. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Average-case complexity and decision problems in group theory. / rank | |||
Normal rank |
Latest revision as of 20:44, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the strongly generic undecidability of the halting problem |
scientific article |
Statements
On the strongly generic undecidability of the halting problem (English)
0 references
6 June 2007
0 references
generic complexity
0 references
halting problem
0 references