DeepAI AI Chat
Log In Sign Up

Pointers in Recursion: Exploring the Tropics

by   Paulin Jacobé de Naurois, et al.
Université Paris 13

We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function. These pointer recursive functions classes are proven equivalent to the usual partial/primitive recursive functions. Complexity-wise, this framework captures in a streamlined way most of the relevant sub-polynomial classes. Pointer recursion with the safe/normal tiering discipline of Bellantoni and Cook corresponds to polylogtime computation. We introduce a new, non-size increasing tiering discipline, called tropical tiering. Tropical tiering and pointer recursion, used with some of the most common recursion schemes, capture the classes logspace, logspace/polylogtime, ptime, and NC. Finally, in a fashion reminiscent of the safe recursive functions, tropical tiering is expressed directly in the syntax of the function algebras, yielding the tropical recursive function algebras.


page 1

page 2

page 3

page 4


Formalizing computability theory via partial recursive functions

We present a formalization of the foundations of computability theory in...

A recursive function coding number theoretic functions

We show that there exists a fixed recursive function e such that for all...

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...

A generic imperative language for polynomial time

We propose a generic imperative programming language STR that captures P...

On Rudimentarity, Primitive Recursivity and Representability

It is quite well-known from Kurt Gödel's (1931) ground-breaking result o...

Regression verification of unbalanced recursive functions with multiple calls (long version)

Given two programs p_1 and p_2, typically two versions of the same progr...

Bouncing Towers move faster than Hanoi Towers, but still require exponential time

The problem of the Hanoi Tower is a classic exercise in recursive progra...