[en] BSS-computable functions can be approached in two ways: from the point of view of computations performed by machines or under the angle of the theory of recursive functions. The goal of this paper is to answer negatively a basic question of the theory of BSS-recursive functions, namely ``is vector-recursion stronger than scalar recursion?''
Research center :
CREMMI - Modélisation mathématique et informatique
Disciplines :
Electrical & electronics engineering Mathematics
Author, co-author :
Troestler, Christophe ; Université de Mons > Faculté des Sciences > Service d'Analyse numérique
Language :
English
Title :
Equivalence of BSS scalar- and vector-recursion
Publication date :
04 June 2001
Journal title :
Bulletin de la Société Mathématique de Belgique
ISSN :
0373-2053
Publisher :
Hirsch, Belgium
Volume :
A tribute to Maurice Boffa
Pages :
65-80
Peer reviewed :
Peer reviewed
Research unit :
S835 - Analyse numérique
Research institute :
R150 - Institut de Recherche sur les Systèmes Complexes
