𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions

✍ Scribed by Gregory A. Riccardi

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
795 KB
Volume
28
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Computation of Partial Recursive Wor
The Computation of Partial Recursive Word-Functions Without Read Instructions
✍ Holger Petersen πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 422 KB πŸ‘ 1 views

## 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

The structure and maximum number of maxi
The structure and maximum number of maximum independent sets in trees
✍ Jennifer Zito πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

Inequalities for the number of monotonic
Inequalities for the number of monotonic functions of partial orders
✍ Jacqueline W Daykin πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 682 KB

Let P be a finite poset and let x, y e P. Let C be a finite chain. Define NS(i, j) to be the number of strict order-preserving maps to: P--~C satisfying to(x)=i and to(y)=j. Various inequalities are proved, commencing with Theorem 2: If r, s, t, u, v, w are non-negative integers then NS(r, u + v + w