Journal Article10.1016/0020-0190(75)90050-2
Sequence-to-sequence recursiveness
17
About: This article is published in Information Processing Letters. The article was published on 01 Sep 1975. The article focuses on the topics: Sequence (medicine) & Parallel processing (DSP implementation).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
New upper bounds for selection
TL;DR: A new upper bound for Vi(n) improves the bound given by the standard Hadian-Sobel algorithm by a generalization of the Kirkpatrick-Hadian-SOBel algorithm, and extends Kirkpatrick's method to a much wider range of application.
43
Computable stack functions for semantics of stack programs
TL;DR: Church's thesis is extended by showing that every computable function N ∗ → N∗ can be characterized as a stack function.
16
General iteration and unary functions
Giorgio Germano,Stefano Mazzanti +1 more
TL;DR: This work suggests a notion of general iteration corresponding to the while-do construct, which leads to new characterizations of general computable unary functions usable in computer science.
10
Partial closures and semantics of while: Towards an iteration-based theory of data types
G. Germano,S. Mazzanti +1 more
- 01 Jan 1984
TL;DR: A generalization of closure theory is proposed and Moore's theory is revisited in this framework and semantics of the while construct is found to be the closure of a function.
8
A hierarchy of primitive recursive sequence functions
TL;DR: A characterization of primitive recursive functions ƒ : N~* N{r^0, s>0) and a Hierarchy of classes b^O) of these functions by a syntactic measure of eomplexity are given.
References
•Book
Categories for the Working Mathematician
Saunders Mac Lane
- 01 Jan 1971
TL;DR: In this article, the authors present a table of abstractions for categories, including Axioms for Categories, Functors, Natural Transformations, and Adjoints for Preorders.
10.5K
Revised report on the algorithm language ALGOL 60
J. W. Backus,Friedrich L. Bauer,J. Green,C. Katz,John J. McCarthy,Alan J. Perlis,Heinz Rutishauser,K. Samelson,B. Vauquois,J. H. Wegstein,A. van Wijngaarden,M. Woodger,Peter Naur +12 more
TL;DR: A survey of the basic coustituents arid fcuturcs of the language is given, and the formal notation, by which the syntactic structure is defined, is explained.
950
Proving a compiler correct: A simple approach
TL;DR: The paper shows how compiler correctness can be proved, provided that semanticsof the source language is defined by recursion on the definition of its syntax.
12
Loops in Algol 60 and in category theory
TL;DR: This feature of ALGOL 60 is certainly some kind of a curiosity, but it might have some significance if one considers that a quite analogous feature appears also in categorial function theory.
1