Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Displaying 21 – 40 of 151
Derivation-Bounded Groups.
K. Madlener, Otto F. (1985)
Revista colombiana de matematicas
Die mit Nestedstackautomaten berechenbaren Funktionen sind elementar.
Heinrich Beck (1975)
Archiv für mathematische Logik und Grundlagenforschung
E. T. a infinitární Churchova teze
Robert M. Baer (1996)
Pokroky matematiky, fyziky a astronomie
Eine Funktionalinterpretation der prädikativen Analysis.
Wolfgang Maaß (1977)
Archiv für mathematische Logik und Grundlagenforschung
Extended primitive recursive functions
P. Mentrasti, M. Protasi (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Finite alogorithmic procedures and computation theories.
J. Moldestad, V. Stoltenberg-Hansen (1980)
Mathematica Scandinavica
Functions provably total in
Zofia Adamowicz, Teresa Bigorajska (1989)
Fundamenta Mathematicae
Functions provably total in
Z. Ratajczyk (1989)
Fundamenta Mathematicae
Goodstein's function.
Caicedo, Andrés Eduardo (2007)
Revista Colombiana de Matemáticas
Hierarchien primitiv-rekursiver Funktionen im Transfiniten.
M.E. Schröder (1970)
Archiv für mathematische Logik und Grundlagenforschung
Horn clause programs and recursive functions defined by systems of equations
Jan Šebelík (1982)
Kybernetika
Infinitary Simultaneous Recursion Theorem.
D. Vaggione (2008)
Mathware and Soft Computing
Isomorphism of index sets of discrete families of general recursive functions.
Korol'kov, Yu.D. (2004)
Sibirskij Matematicheskij Zhurnal
Jede mit Stackautomaten berechenbare Funktion ist elementar.
Horst Müller (1972)
Archiv für mathematische Logik und Grundlagenforschung
La fonction d'Ackermann : un nouveau mode de dérécursivation
Jacques Arsac (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Limiting recursion and the arithmetic hierarchy
G. Criscuolo, E. Minicozzi, G. Trautteur (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
New recursive characterizations of the elementary functions and the functions computable in polynomial space.
I. Oitavem (1997)
Revista Matemática de la Universidad Complutense de Madrid
We formulate recursive characterizations of the class of elementary functions and the class of functions computable in polynomial space that do not require any explicit bounded scheme. More specifically, we use functions where the input variables can occur in different kinds of positions ?normal and safe? in the vein of the Bellantoni and Cook's characterization of the polytime functions.
Non recursive functions have transcendental generating series
Felipe Cucker, Joaquim Gabarró (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On certain decompositions of Gödel numberings.
B. Buchberger (1974)
Archiv für mathematische Logik und Grundlagenforschung