DeepAI AI Chat
Log In Sign Up

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

by   Eugene Eberbach, et al.

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 problems. These are U-complete (Universal complete), D-complete (Diagonalization complete) and H-complete (Hypercomputation complete) classes. We started the population process of these new classes. We justify that some super-Turing models of computation, i.e., models going beyond Turing machines, are tremendously expressive and they allow to accept arbitrary languages over a given alphabet including those undecidable ones. We prove also that one of such super-Turing models of computation – the $-Calculus, designed as a tool for automatic problem solving and automatic programming, has also such tremendous expressiveness. We investigate also completeness of cost metrics and meta-search algorithms in $-calculus.


page 1

page 2

page 3

page 4


Encoding Turing Machines into the Deterministic Lambda-Calculus

This note is about encoding Turing machines into the lambda-calculus....

FIFTH system for general-purpose connectionist computation

To date, work on formalizing connectionist computation in a way that is ...

Alternating Automatic Register Machines

This paper introduces and studies a new model of computation called an A...

Toward General Analysis of Recursive Probability Models

There is increasing interest within the research community in the design...

Cinnamons: A Computation Model Underlying Control Network Programming

We give the easily recognizable name "cinnamon" and "cinnamon programmin...

Self-Reproducing Coins as Universal Turing Machine

Turing-completeness of smart contract languages in blockchain systems is...

Three computational models and its equivalence

The study of computability has its origin in Hilbert's conference of 190...