Selected talks
2017
 On badic representations of irrational numbers.
PCC 2017, Göttingen.
The beamer presentation is available
here.
 On Resource Analysis of Imperative Programs.
DICEFOPARA 2017,
8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis.
April 2223, 2017, Uppsala, Sweden.
Invited talk.
The beamer presentation is available
here.
2016
 On Subrecursive Representability of Irrational Numbers.
PCC 2016,  International Workshop on Proof, Computation,
Complexity  May 56, 2016, München, Germany.
 Subrecursive Sum Approximations of Irrational Numbers.
CiE 2016  Computability in Europe 2016:
Pursuit of the Universal  Paris, France, 27 June to 1 July 2016.
The beamer presentation is available
here.
 On Subrecursive Representability of Irrational Numbers.
Workshop on Computability Theory 2016
 July 45, 2016, Ghent, Belgium. Invited talk.
2015
 Subrecursive Dedekind and Cauchy Reals.
CiE 2015  Computability in Europe 2015:
Evolving Computability,
Bucharest, Romania, 29 June to 3 July 2015.
2014
 How to state and prove Gödel's 1st Incompleteness Theorem  a glance at a new textbook on mathematical logic and computability theory.
PCC 2014,  International Workshop on Proof, Computation,
Complexity  May 1516, 2014, Paris, France.
The beamer presentation is available
here.
2013
 On Resource Analysis of Imperative Programs.
Invited talk given at the Institute of Computer Science, University of
Innsbruck, Austria, May 23, 2013. The beamer presentation is available
here.
 Subrecursive Degrees of Honest Functions and Provably Recursive
Functions.
Invited talk given at LIRMM (Laboratory of Informatics, Robotics and Microelectronics), Montpellier University, Montpellier, France,
December 4, 2013.
The beamer presentation is available
here.
2012
 Degrees of Total Algorithms versus Degrees of Honest Functions.
CiE 2012  Computability in Europe 2012:
How the World Computes,
Cambrigde, UK, 18 June  23 June, 2012.
 Degrees of Total Algorithms versus Degrees of Honest Functions.
PCC 2012,  International Workshop on Proof, Computation,
Complexity  Copehagen University,
17 August  18 August, 2012, Copehagen, Denmark.
2011
 Det tellbare og det overtellbare. (The countable and the uncoutable.)
Faglig pedagogisk dag ved Universitetet i Oslo, 27. oktober 2011.
 Subrecursive degrees of honest functions and provably recursive functions.
Infinity Conference.
Centre de Recerca MatemÃ tica (CRM), Bellaterra, Barcelona, Spain.
July 18  July 22, 2011. Invited talk.
 Decidable and undecidable problems related to
complexity analysis of loop programs.
CiE 2011  Computability in Europe 2011:
Models of Computation in Context,
Sofia, Bulgaria, 27 June  2 July, 2011.
 Honest subrecursive degree theory and provability
in Peano Arithmetic.
PCC 2011,  International Workshop on Proof, Computation,
Complexity  Ghent University,
6 June  7 June, 2011, Ghent, Belgium.
2010
 Honest degree theory and statements independent of Peano Arithmetic.
PCC 2010, University of Bern, Switzerland
18 June  19 June, 2010.
 Subrecursive degrees and statements independent of Peano Arithmetic.
CiE 2010, Ponta Delaga, Azores, Portugal,
30 June  4 July, 2010.
 Two notion of nondeterminism and fragments of GÃ¶del's T.
CiE 2010, Ponta Delaga, Azores, Portugal,
30 June  4 July, 2010.
2009

Implicit Computational Complexity: Moving on from the Extensional
to the Intentional.
8th Proof, Computation and Complexity
PCC 2009 .
2  3 July 2009
LORIA  Nancy, France. Invited talk.
 The Semantics and Complexity of SuccessorFree Nondeterministic GÃ¶del's T and PCF.
CiE 2009, University of Heidelberg,
19 June  24 June, 2009.

Complexity Analysis of Imperative Programs.
The Tenth International Workshop on Logic and Computational Complexity
LCC 2009. Los Angeles, August 10, 2009 (an affiliated meeting
of LiCS 2009). Invited talk.
2008
 Implicit Characterisations of Complexity Classes and Recursion in Higher Types.
Workshop on Implicit Computational Complexity,
February 111213, 2008, Villetaneuse (Paris). Invited talk.
 The Structure of Detour Degrees.
TAMC 2008. Xi'an, China, April 25 to 29, 2008.
 Recursion in Higher Types and Resource Bounded Turing machines.
CiE 2008, University of Athens,
15 June  20 June, 2008.
Invited talk in Special Session (highertype recursion and applications).
2007
 Beregnbarhet, kompleksitet og typeteori (Computability, complexity and type theory).
Felleskollokviet (Mathematics Colloquium), Department of Mathematics,
University of Oslo, March 30, 2007.
 Complexity theory and Gödel's T.
PCC '07  International Workshop on Proof, Computation,
Complexity. Swansea, Wales,
April 1314, 2007.
 Neil Jones: The early years.
Talk given at
A TRIBUTE WORKSHOP AND FESTIVAL
TO HONOR
Professor Dr. Neil D. Jones, Copenhagen,
2526 August, 2007
 Complexity Analysis of Programs: Methods and Challenges.
The 3rd DIKUIST Joint Workshop on Foundations of Software.
Roskilde, Denmark, October 56, 2007.
2006
 ComplexityTheoretic Hierarchies
Copenhagen Programming Language Seminar, March 30, 2006,
DIKU. Invited talk.
 The Tradeoff Theorem and Fragments of Gödel's T.
TAMC2006: Theory and Applications of Models of Computation, Beijing
China 15 May 
20 May, 2006.
 ComplexityTheoretic Hierarchies.
CiE 2006  Computability in Europe 2006:
Logical Approaches to Computational Barriers, University of Wales Swansea
30 June  5 July, 2006.
 $T^{}$Hierarchies and the Tradeoff Theorem.
PCC '06  6th International Workshop on Proof, Computation,
Complexity. Ilmenau, Germany,
July 2526, 2006.
 Fragments of Gödel's T, Complexity Classes and Rewriting Systems.
"Workshop on Proof Theory and
Rewriting", Obergurgl University Center, September 59 2006, Austria.
 Static Complexity Ananlysis of Programs.
The Norwegian Computer Science Conference 2006 (NIK 2006), November 2022, Molde.
2005
 KleeneKreisel Functionals and Computational Complexity.
CiE 2005  Computability in Europe 2005: New Computational Paradigms,
University of Amsterdam, June 812, 2005
 The Flow of Data and the Complexity of Algorithms.
CiE 2005  Computability in Europe 2005: New Computational Paradigms,
University of Amsterdam, June 812, 2005
 Computational Complexity and Natural Programming Languages.
PCC '05  4th International Workshop on Proof, Computation, Complexity.
July 1617, 2005, Lisbon.
 Feasible Programs and Natural Programming Languages
17th Nordic Workshop on Programming Theory, Copenhagen Denmark, 1921 October 2005.
2004
 Small complexity classes and fragments of Gödel's system T..
June 19., 2004.
International meeting on "Proof, Computation, Complexity".
Technische Universit\"at Dresden, Germany.
 Characterization of
Complexity Classes and Complexity Analysis of Programs.
Guest lecture, September 21. 2004,
Department of Informatics, University of Oslo.
 Programming Languages Capturing Complexity Classes.
NWPT'04, October 7. 2004, Uppsala, Sweeden.
2003
 Complexity classes, Functions Algebras and Fragments of
Standard Imperative Programming Languages .
January 22, 2003, University of Aarhus, BRICS Logic and Semantics and BRICS Research
Seminar.
 Computing without the Successor Function. New
Characterizations of Well Known Complexity Classes..
July 4., 2003.
International meeting on "Proof, Computation, Complexity".
Technische Universit\"at Dresden, Germany.
 Characterization of Complexity Classes and Complexity Analysis
of Programs.
July 9., 2003, Fakult\"atskolloquium,
Technische Universit\"at Ilmenau, Germany.
 The surprising power of restricted programs and Gödel's functionals.
August 25. 2003, CSL 2003, Vienna, Austria.
2002
 The outline of a research project in implisit
computational complexity theory. April 9. 2002.
International meeting on "Proof, Computation, Complexity".
University of Tuebingen, Germany.
 New recursiontheoretic characterizations of
wellknown complexity classes.
ICC'02. (Implicitit Computational Complexity 2002)
July 2021, 2002, in Copenhagen, Denmark.
 Characterizations of Complexity Classes
and Complexity Analysis of Programs.
TOPPS Seminar. Datalogisk institutt KÃ¸benhavns Universitet.
September 30, 2002, University of Copenhagen.
 Complexity Classes and Fragments of C.
November 28, 2002,
The IT University of Copenhagen, Theory Seminar.
Before 2002
 On some classes of subrecursive functions.
Norsk Informatikkonferanse '94, HÃ¸gskolen i Molde 14.16. november 1994.
 A jump operator on honest subrecursive degrees.
Complexity, Logic and Recursion Theory 1995 Coloret Workshop.
May 26, 1995, in Siena (Certosa di Pontignano), Italy.
 A jump operator on honest subrecursive degrees.
ASL Logic Colloquium 95, Haifa, Israel, August 917, 1995.
 Hva er matematisk logikk? To teoremer av Kurt Godel.
PopulÃ¦rvitenskapelig foredrag ved
fagligpedagogisk dag ved Universitetet i Oslo i 1993, 1995 og 1996.

Information content and computational
complexity of recursive sets. GODEL '96, August 2529, 1996,
in Brno, Czech Republic.
 The honest subrecursive degrees.
The 7th Scandinavian Logic Symposium.
August 1820, 1996, in Uppsala, Sweden.
 Refinements of some basic results in recursion theory.
Norsk Informatikkonferanse '96. HÃ¸gskolen i Alta, 18.20. november 1996.
 Information content and computational
complexity of recursive sets.
ASL Logic Colloquium 97, Juli 712, 1997, in Leeds, UK.
 Formal Numbertheory, Independence Proofs, and Subrecursive Degree Structures.
First Panhellenic Symposium on Logic. Juli, 1997, in Nikosia, Cypros.
 Honest and semihonest degrees.
A subrecursive degree structure related to fragments of Peano Arithmetic.
Logic Seminar, Department of Pure Mathematics,
University of Leeds.
November 1997.
 Et kritisk blikk pÃ¥ ChurchTurings tese.
PopulÃ¦rvitenskapelig foredrag ved
fagligpedagogisk dag ved Universitetet i Oslo i 1999.
 $\mbox{Low}_n$, $\mbox{high}_n$, and intermediate subrecursive degrees.
DMTS'99 and CATS'99. January 1821, 1999,
in Auckland, New Zealand.
 Honest and semihonest subrecursive degrees.
ASL Logic Colloquium 2000, Juli 2331, 2000, in Paris, France.
 Et kritisk blikk pÃ¥ ChurchTurings tese og et
ukritisk blikk pÃ¥ Gurevich' tese.
Foredrag i Logisk forum ved Universitetet i Oslo, hÃ¸sten 2000.
 The Computational Complexity of Loop Programs
Fakult\"atskolloquium,
Technische Universit\"at Ilmenau, Desember 6. 2000.
 On the computational complexity of imperative
programming languages. October 4. 2001.
BRICS Research Seminar  Logic and Sematics Series,
in Aarhus, Denmark.