Recursive Word-Functions over Infinite Alphabets
✍ Scribed by Vladeta Vučkovi
- Publisher
- John Wiley and Sons
- Year
- 1970
- Tongue
- English
- Weight
- 739 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We state and prove an inÿnite alphabet counterpart of the classical Myhill-Nerode theorem.
In this paper we show that Shannon's general purpose analog computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene's classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these mod
## 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