Higher type recursion, ramification and polynomial time

13 years 4 months ago

Download www.tu-ilmenau.de

It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.

Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Sc

Real-time Traffic

APAL 2000 | Finite Types | Ramified Type Structure | Time Computable Functions |

claim paper

» Soft lambdaCalculus A Language for Polynomial Time Computation

» A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial T...

» Polynomial Pipelined Neural Network and Its Application to Financial Time Series Predictio...

» Adventures in time and space

» Type Inference with Inequalities

» Predicative Analysis of Feasibility and Diagonalization

» Static Determination of Quantitative Resource Usage for HigherOrder Programs

» On the Computational Capabilities of Several Models

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	APAL
Authors	Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg

Comments (0)

Sciweavers

Higher type recursion, ramification and polynomial time

APAL 2000 | Finite Types | Ramified Type Structure | Time Computable Functions |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers