A. Matos homepage

Recovered from an older version

Armando B. Matos
$ Display all 3194 possibilities? (y or n)


Researcher and retired teacher, email: reverse "moc.oohay@mcbodnamra"
LIACC, Artificial Intelligence Computer Science Laboratory    /    Computer Science Department    /    Faculty of Sciences    /    FCUP info    /    Universidade do Porto    /    Porto
What can be asserted without evidence can also be dismissed without evidence.

 

            Papers (below)            

            Reversible languages: work in progress (pdf)                   Course: “Topics on Advanced Algorithms”
            Reversible languages: TCS paper (pdf)                   Course: “Introductory Programming”
            ...A text on advanced algorithms (pdf).                   Course: “Complexity”
            Mathoverflow                   Course: “Imperative Programming”
            Research on primitive recursive functions                   C.A.R. Hoare on categories (only for my study)
Pr. recursive functions: implementation efficiency                   Logicians discussing weak arithmetics
AI & CS Lab, LIACC, Univ. Porto                   Consequences of Godel's Incompleteness Theorem
Programming is useful...                   Panflation!        
List of quotes...             Frege
"Random" quote:

  Robin Fairbairns
     The TEX community seems to me to function best when very small groups
     are doing the work. Examples include (almost) one-man-bands that
     produce distributions like Web2C, teTEX and MiKTEX.

     By contrast, I have a strong suspicion that large TEX projects tend to
     run very slowly!

List of papers and research notes

Available papers: click on the title to see the document