On reducibility by recursive functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Reducibility of Submodular Functions

The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that enables us to reduce the solution space of submodular optimization problems without performance loss. We introduce the concept of reducibility using marginal gains. Then we show that by adding perturbation, we can endow...

متن کامل

Two Notes on Recursive Functions

Introduction. The theory of regressive isols was introduced by J. C. E. Dekker in [7]. The results that we wish to present in this paper belong to this theory and is a continuation of some of our studies in [1], [3] and [4]. We will assume that the reader is familiar with the terminology and some of the main results of the papers listed as references. We let E denote the collection of all nonne...

متن کامل

A Note on Recursive Functions

In this paper, we propose a new and elegant deenition of the class of recursive functions, analogous to Kleene's deenition but diiering in the primitives taken, thus demonstrating the computational power of the concurrent programming language in-The deenition can be immediately rephrased for any distributive graph in a count-ably extensive category with products, thus allowing a wide, natural g...

متن کامل

Analysis of Parallelism in Recursive Functions on Recursive Data Structures

In functional languages, iterative operations on data collections are naturally expressed using recursive functions on recursive data structures. In this paper, we present a method to extract data parallelism from recursive functions and generate data parallel programs. As the parallel model for object programs, we use polytypic parallel skeletons. This model can express data parallel operation...

متن کامل

Tcs Technical Report Learning Recursive Functions Learning Recursive Functions

Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold’s (1967) model of learning in the limit, many variations, modifications and extensions have been proposed. These models differ in some of the following: the mode of convergence, the requirements intermediate hypotheses have to fulfill, the set of allowed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1964

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1964-0179079-9