On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus (Q6040672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7687249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus |
scientific article; zbMATH DE number 7687249 |
Statements
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus (English)
0 references
19 May 2023
0 references
automatic problem solving
0 references
automatic programming
0 references
undecidability
0 references
intractablity
0 references
recursive algorithms
0 references
recursively enumerable but not recursive algorithms
0 references
non-recursively enumerable algorithms
0 references
super-Turing computation
0 references
super-recursive algorithms
0 references
p-decidability
0 references
e-decidability
0 references
a-decidability
0 references
i-decidability
0 references
reduction techniques
0 references
U-completeness
0 references
D-completeness
0 references
H-completeness
0 references
\$-calculus
0 references
cost metrics completeness
0 references
meta-search algorithms completeness
0 references
0 references
0.8296137
0 references
0 references
0.8144716
0 references
