Eugene Eberbach
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Eugene Eberbach has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Mark Burgin
University of California
1 shared publication- Mark Burgin
Department of Computer Science, University of California, Los Angeles (UCLA), Los Angeles, CA 90095, USA
1 shared publication
Latest Publications
- 1 September 2015
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 139 (4) , 329-346
On Hypercomputation, Universal and Diagonalization Complete Problems
In the paper we define the class of hypercomputation complete and hard undecidable problems. We prove that typical unsolvable problems are decidable in infinity. We hypothesize that all undecidable problems can be reduced in infinity to each other, i.e., they are ℋ-complete (hypercomputation complete). We propose also two other classes: 𝒰-complete (universal complete) and 𝒟-complete (diagonalization complete) that use asymptotic reduction and allow separate non- RE and RE non-recursive undecidable classes.
- 1 September 2015
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 139 (4) , 329-346
On Hypercomputation, Universal and Diagonalization Complete Problems
In the paper we define the class of hypercomputation complete and hard undecidable problems. We prove that typical unsolvable problems are decidable in infinity. We hypothesize that all undecidable problems can be reduced in infinity to each other, i.e., they are ℋ-complete (hypercomputation complete). We propose also two other classes: 𝒰-complete (universal complete) and 𝒟-complete (diagonalization complete) that use asymptotic reduction and allow separate non- RE and RE non-recursive undecidable classes.
- 1 January 2014
- Published by Springer Nature
- p. 117-126
A Uniform Problem Solving in the Cognitive Algebra of Bounded Rational Agents
- 1 January 2014
- Published by Springer Nature
- p. 117-126
A Uniform Problem Solving in the Cognitive Algebra of Bounded Rational Agents
- 1 January 2013
- Published by Springer Nature
- p. 201-230
Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
- 1 January 2013
- Published by Springer Nature
- p. 201-230
Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
- 1 January 2009
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 91 (1) , 53-77
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata considered in this paper are evolutionary Turing machines and evolutionary inductive Turing machines. Various subclasses and modes of evolutionary computation are defined. Problems of existence of universal objects in these classes are explored. Relations between Turing machines, inductive Turing machines, evolutionary Turing machines, and evolutionary inductive Turing machines are investigated.
- 1 January 2009
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 91 (1) , 53-77
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata considered in this paper are evolutionary Turing machines and evolutionary inductive Turing machines. Various subclasses and modes of evolutionary computation are defined. Problems of existence of universal objects in these classes are explored. Relations between Turing machines, inductive Turing machines, evolutionary Turing machines, and evolutionary inductive Turing machines are investigated.
- 22 October 2007
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 49 (2) , 316-330
Approximate reasoning in the algebra of bounded rational agents
- 22 October 2007
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 49 (2) , 316-330
Approximate reasoning in the algebra of bounded rational agents