activity
20062026
most citedEvolutionary Turing in the Context of Evolutionary Machines

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2021 · cs.CCShow all

1 paper · 2 filters

cs.CC2021

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

Eugene Eberbach

In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problem…