## Abstract In this note we consider register‐machines with symbol manipulation capabilities. They can form words over a given alphabet in their registers by appending symbols to the strings already stored. These machines are similar to Post's normal systems and the related machine‐models discussed
Effective Enumerability of Some Families of Partially Recursive Functions Connected With Computable Functionals
✍ Scribed by Vladeta Vučković
- Publisher
- John Wiley and Sons
- Year
- 1970
- Tongue
- English
- Weight
- 464 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We introduce the subclass P P j, , ␣ , n of starlike functions with negative coefficients by using the differential operator D n which was considered by G. S ¸t.
The authors introduce and study three novel subclasses of analytic and p-valent functions with negative coefficients. In addition to finding a necessary and sufficient condition for a function to belong to each of these subclasses, a number of other potentially useful properties and characteristics
## Abstract Recent studies of functional connectivity based upon blood oxygen level dependent functional magnetic resonance imaging have shown that this technique allows one to investigate large‐scale functional brain networks. In a previous study, we advocated that data‐driven measures of effectiv
The object of this paper is to present a systematic introduction to (and several interesting applications of) a general result on generating functions (associated with the Stirling numbers of the second kind) for a fairly wide variety of special functions and polynomials in one, two, and more variab
This paper deals with the existence of periodic solutions for some partial functional differential equations with infinite delay. We suppose that the linear part is nondensely defined and satisfies the Hille᎐Yosida condition. In the nonlinear case we give several criteria to ensure the existence of