Results 301 to 310 of about 391,750 (316)
Some of the next articles are maybe not open access.
Discrete Mathematics and Applications, 1997
The author's point-of-entry is with basic concepts from \textit{J. C. E. Dekker} on regressive isols [Math. Z. 83, 345-366 (1964; Zbl 0122.01002)] and \textit{E. Ellentuck} on degrees of universal regressive isols [Math. Scand. 32, 145-164 (1973; Zbl 0275.02040)]. Three interesting theorems are proved extending results on recursive isol structure; e.g.,
openaire +3 more sources
The author's point-of-entry is with basic concepts from \textit{J. C. E. Dekker} on regressive isols [Math. Z. 83, 345-366 (1964; Zbl 0122.01002)] and \textit{E. Ellentuck} on degrees of universal regressive isols [Math. Scand. 32, 145-164 (1973; Zbl 0275.02040)]. Three interesting theorems are proved extending results on recursive isol structure; e.g.,
openaire +3 more sources
BIT, 1983
In the case of degeneracy in an LP-formulation, there is not a one-to-one correspondence between extreme points and feasible bases. If the task is to find thek best extreme points in the set of feasible solutions to an LP, this lack of correspondence has a certain importance, since methods based on the Simplex Algorithm are oriented towards feasible ...
openaire +3 more sources
In the case of degeneracy in an LP-formulation, there is not a one-to-one correspondence between extreme points and feasible bases. If the task is to find thek best extreme points in the set of feasible solutions to an LP, this lack of correspondence has a certain importance, since methods based on the Simplex Algorithm are oriented towards feasible ...
openaire +3 more sources
Strong Reducibilities of Enumerations and Partial Enumerated Algebras
Mathematical Logic Quarterly, 1988Let \(\nu_ 1\) and \(\nu_ 2\) be two enumerations of a set S and consider the total (respectively, partial) functions from S to S. If all such \(\nu_ 1\)-computable functions are \(\nu_ 2\)-computable and if there is a recursive function that maps each \(\nu_ 1\)-index of a \(\nu_ 1\)- computable function to a \(\nu_ 2\)-index of that function, then \(\
openaire +3 more sources
Mathematical Notes of the Academy of Sciences of the USSR, 1984
Rogers has introduced the concept of stable enumeration and has proved that every precomplete enumeration is stable. Ershov strengthened this result by showing that a precomplete enumeration is strongly stable. In the present paper one constructs, in an elegant way, a class of strongly stable enumerations.
openaire +1 more source
Rogers has introduced the concept of stable enumeration and has proved that every precomplete enumeration is stable. Ershov strengthened this result by showing that a precomplete enumeration is strongly stable. In the present paper one constructs, in an elegant way, a class of strongly stable enumerations.
openaire +1 more source
2010
In Chapter 14, you saw that you can use a foreach statement to cycle through the elements of an array. In this chapter, you’ll take a closer look at arrays and see why they can be processed by foreach statements. You’ll also look at how you can add this capability to your own user-defined classes. Later in the chapter, I’ll explain the use of iterators.
openaire +2 more sources
In Chapter 14, you saw that you can use a foreach statement to cycle through the elements of an array. In this chapter, you’ll take a closer look at arrays and see why they can be processed by foreach statements. You’ll also look at how you can add this capability to your own user-defined classes. Later in the chapter, I’ll explain the use of iterators.
openaire +2 more sources
ENUMERATION OF SOME CLASSES OF RECURSIVELY ENUMERABLE SETS [PDF]
Mathematical Logic Quarterly, 1964 openaire +2 more sources