|
|
|
Volumn , Issue , 1997, Pages 294-305
|
|
`Hardest' natural decidable theory
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
PROBLEM SOLVING;
THEOREM PROVING;
TURING MACHINES;
NATURAL DECIDABLE THEORY;
DECISION THEORY;
|
|
EID: 0030711478
PISSN: 10436871
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (8)
|
|
References (21)
|
