Seminários de Lógica Matemática

6 de Março, 17h00

POINTERS AS A TOOL TO REACH COMPLEXITY CLASSES
SALA 3.10 - IST

ISABEL OITAVEM (U NOVA DE LISBOA & CMAF - U LISBOA)

Abstract:

We introduce the input-sorted notation due to Bellantoni and Cook and their characterization of FPtime, rewritten over the word algebra W.
The notion of pointers in the recursion schemes is discussed, and within it some classes of complexity are characterized.

| back