- Tytuł:
- On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
- Autorzy:
- Eberbach, Eugene
- Tematy:
-
automatic problem solving
automatic programming
undecidability
intractablity
recursive algorithms
recursively enumerable but not recursive algorithms
non-recursively enumerable algorithms
super-Turing computation
super-recursive algorithms
p-decidability
e-decidability
a-decidability
i-decidability
reduction techniques
U-completeness
D-completeness
H-completeness
$-calculus
cost metrics completeness
meta-search algorithms completeness - Pokaż więcej
- Dostawca treści:
- BazTech
Artykuł