Results 231 to 240 of about 5,380,347 (268)
Some of the next articles are maybe not open access.
On C-Degrees, H-Degrees and T-Degrees
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007Following a line of research that aims at relating the computation power and the initial segment complexity of a set, the work presented here investigates into the relations between Turing reducibility, defined in terms of computation power, and C-reducibility and H-reducibility, defined in terms of the complexity of initial segments.
Wolfgang Merkle, Frank Stephan 0001
openaire +1 more source
Degrees of Efficiency and Degrees of Minimality
SIAM Journal on Control and Optimization, 2003Summary: We characterize different types of solutions of a vector optimization problem by means of a scalarization procedure. Usually different scalarizing functions are used in order to obtain the various solutions of the vector problem. Here we consider different kinds of solutions of the same scalarized problem.
openaire +2 more sources
J. Autom. Lang. Comb., 2007
In this paper, the degree of parallelism is introduced and investigated. The degree of parallelism is a natural descriptional complexity measure of Lindenmayer and Bharat systems. This concept quantifies the amount of non-redundant parallelism needed in the derivations of those systems.
Henning Bordihn, Henning Fernau
openaire +1 more source
In this paper, the degree of parallelism is introduced and investigated. The degree of parallelism is a natural descriptional complexity measure of Lindenmayer and Bharat systems. This concept quantifies the amount of non-redundant parallelism needed in the derivations of those systems.
Henning Bordihn, Henning Fernau
openaire +1 more source
Siberian Mathematical Journal, 1974
For one partial function to be partial recursive in another requires a partial recursive operator; this relation yields the partial degrees [see \textit{H. Rogers jun.}, Theory of recursive functions and effective computability. Maidenhead, Berksh.: McGraw-Hill Publishing Company, Ltd. (1967; Zbl 0183.01401)].
openaire +2 more sources
For one partial function to be partial recursive in another requires a partial recursive operator; this relation yields the partial degrees [see \textit{H. Rogers jun.}, Theory of recursive functions and effective computability. Maidenhead, Berksh.: McGraw-Hill Publishing Company, Ltd. (1967; Zbl 0183.01401)].
openaire +2 more sources
Communications of the ACM, 2012
Rsearchers now have the capability to look at the small-world problem from both the traditional algorithmic approach and the new topological approach.
openaire +1 more source
Rsearchers now have the capability to look at the small-world problem from both the traditional algorithmic approach and the new topological approach.
openaire +1 more source
2015
Our objects of study are infinite sequences and how they can be transformed into each other. As transformational devices, we focus here on Turing Machines, sequential finite state transducers and Mealy Machines. For each of these choices, the resulting transducibility relation ≥ is a preorder on the set of infinite sequences.
Jörg Endrullis +3 more
openaire +2 more sources
Our objects of study are infinite sequences and how they can be transformed into each other. As transformational devices, we focus here on Turing Machines, sequential finite state transducers and Mealy Machines. For each of these choices, the resulting transducibility relation ≥ is a preorder on the set of infinite sequences.
Jörg Endrullis +3 more
openaire +2 more sources
Journal of Symbolic Logic, 1981
Consider those structures that consist of a countable universe and a finite number of predicates and functions. Let = ‹∣∣, P1, …, Pn, f1, …, fm› be such a structure. We will restrict our consideration to structures, , whose universe, ∣∣, is a set of natural numbers, and thus we will be able to apply the notions of recursion theory to structures. Using
openaire +1 more source
Consider those structures that consist of a countable universe and a finite number of predicates and functions. Let = ‹∣∣, P1, …, Pn, f1, …, fm› be such a structure. We will restrict our consideration to structures, , whose universe, ∣∣, is a set of natural numbers, and thus we will be able to apply the notions of recursion theory to structures. Using
openaire +1 more source