Computability of recurrence equations

نویسندگان
چکیده

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

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

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

منابع مشابه

Computability with Polynomial Differential Equations

In this paper, we show that there are Initial Value Problems defined with polynomial ordinary differential equations that can simulate universal Turing machines in the presence of bounded noise. The polynomial ODE defining the IVP is explicitly obtained and the simulation is performed in real time.

متن کامل

A new face of the branching recurrence of computability logic

This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic, and proves its equivalence to the old, “canonical” version. MSC: primary: 03B47; secondary: 03B70; 68Q10.

متن کامل

Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations

Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. Recently, researchers have begun to relax this restriction to include systems of affine recurrence equations. A system of uniform recurrence equations typically can be embedded in spacetime so that the distance between a variable and a depende...

متن کامل

Random Recurrence Equations

We develop sharp large deviation asymptotics for the probability of ruin in a Markov-dependent stochastic economic environment and study the extremes for some related Markovian processes which arise in financial and insurance mathematics, related to perpetuities and the ARCH(1) and GARCH(1,1) time series models. Our results build upon work of Goldie [Ann. Appl. Probab. 1 (1991) 126–166], who ha...

متن کامل

Structured Scheduling of Recurrence Equations

We study scheduling of structured systems of recurrence equations. We rst recall the formalism of structured systems of recurrence equations, then we explain how to implement a scheduling tool for non-structured systems of reccurence equations. We introduce the notion of structured schedule and propose criteria for determining whether a structured system of reccurence equations admits a structu...

متن کامل

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


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

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1993

ISSN: 0304-3975

DOI: 10.1016/0304-3975(93)90326-o