Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Eberbach, Eugene; *; †
Affiliations: Department of Engineering and Science, Rensselaer Polytechnic Institute, Hartford, CT, USA, [email protected]
Correspondence: [†] Address for correspondence: Deprtment of Engineering and Sci., Rensselaer Polytechnic Institute, Hartford, CT, USA.
Note: [*] retired Professor of Practice, RPI Hartford, CT. This paper has been written in memories of Professor Peter Wegner from Brown University and Professor Mark Burgin from University of California Los Angeles with whom I had the honor and pleasure to cooperate for several years.
Abstract: 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. In the paper, in the spirit of Cook/Levin/Karp, we started the population process of these new classes assigning several undecidable problems to them. 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.
Keywords: 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
DOI: 10.3233/FI-222142
Journal: Fundamenta Informaticae, vol. 188, no. 2, pp. 63-90, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]