Lars Kristiansen

Professor - PROG Programmering
Bilde av Lars Kristiansen
English version of this page
Mobiltelefon +47 922 10 527
Brukernavn
Besøksadresse Niels Henrik Abels hus Moltke Moes vei 35 0851 OSLO
Postadresse Postboks 1080 0316 Oslo
Andre tilknytninger Matematisk institutt

Hvis du vil vite litt mer om mine faglige interesser, så  klikk her.

Emneord: matematisk logikk, beregnbarhetsteori, kompleksitetsteori, beregnbar analyse

Publikasjoner

Se alle arbeider i Cristin

Se alle arbeider i Cristin

  • Kristiansen, Lars (2021). On subrecursive representation of irrational numbers: Contractors and Baire sequences.
  • Kristiansen, Lars (2021). On Representations of Irrational Numbers: A Degree Structure.
  • Kristiansen, Lars (2021). Implicit characterisations of complexity classes by inherently reversible programming languages.
  • Kristiansen, Lars (2021). Classic representations of irrational numbers seen from a computability and complexity-theoretic perspective.
  • Kristiansen, Lars (2020). On Interpretability Between some Weak Essentially Undecidable Theories.
  • Kristiansen, Lars (2020). Reversible Programming Languages Capturing Complexity Classes.
  • Kristiansen, Lars (2019). Best Approximations, Contractions Maps and Continued Fractions.
  • Kristiansen, Lars (2019). On Subrecursive Representability of Irrational Numbers: Continued Fractions and Contraction maps.
  • Kristiansen, Lars (2018). On General Sum Approximations of Irrational Numbers. .
  • Kristiansen, Lars (2018). Decidable and Undecidable Fragments of First-Order Concatenation Theory. .
  • Kristiansen, Lars (2017). On Resource Analysis of Imperative Programs. Electronic Proceedings in Theoretical Computer Science (EPTCS). ISSN 2075-2180. 248. doi: 10.4204/EPTCS.248.
  • Kristiansen, Lars (2017). On Resource Analysis of Imperative Programs.
  • Kristiansen, Lars (2016). On Subrecursive Representability of Irrational Numbers.
  • Kristiansen, Lars (2016). Subrecursive Sum Approximations of Irrational Numbers.
  • Kristiansen, Lars (2016). On Subrecursive Representability of Irrational Numbers.
  • Kristiansen, Lars (2015). Subrecursive Dedekind and Cauchy reals.
  • Kristiansen, Lars; Aanderaa, Stål & Ruud, Hans-Kristian (2014). A Preliminary Report on Search for Good Examples of Hall's Conjecture. arXiv.org. ISSN 2331-8422.
  • Kristiansen, Lars (2012). Degrees of Total Algorithms versus Degrees of Honest Functions.
  • Kristiansen, Lars (2011). Honest subrecursive degree theory and provability in Peano Arithmetic.
  • Ben-Amram, Amir & Kristiansen, Lars (2011). Decidable and undecidable problems related to complexity analysis of loop programs.
  • Kristiansen, Lars (2011). Subrecursive degrees of honest functions and provably recursive functions.
  • Kristiansen, Lars (2011). Review of the book "New Computational Paradigms (eds.: Cooper, Löwe, Sorbi)". Studia Logica: An International Journal for Symbolic Logic. ISSN 0039-3215. 97, s. 313–316.
  • Kristiansen, Lars (2011). New computational paradigms. Studia Logica: An International Journal for Symbolic Logic. ISSN 0039-3215. 97(2), s. 313–316. doi: 10.1007/s11225-011-9308-4.
  • Kristiansen, Lars; Weiermann, Andreas & Schlage-Puchta, Jan-Christoph (2010). Subrecursive degrees and statements independent of Peano Arithmetic.
  • Kristiansen, Lars (2010). Honest degree theory and statements independent of Peano Arithmetic.
  • Kristiansen, Lars & Mender, Bedeho (2010). Two notions of non-determinism in Gödel's system T.
  • Kristiansen, Lars & Ben-Amram, Amir (2009). The limits of decidability and tractability in growth-rate analysis for programs.
  • Kristiansen, Lars & Mender, Bedeho (2009). The Semantics and Complexity of Successor-free Nondeterministic Gôdel’s T and PCF.
  • Kristiansen, Lars (2009). Complexity Analysis of Imperative Programs.
  • Kristiansen, Lars & Mender, Bedeho (2009). The Semantics and Complexity of Successor-Free Nondeterministic Gödel's T and PCF.
  • Kristiansen, Lars (2009). Implicit Computational Complexity: Moving on from the Extensional to the Intentional.
  • Kristiansen, Lars (2008). The Structure of Detour Degrees.
  • Kristiansen, Lars (2008). Recursion in Higher Types and Resource Bounded Turing machines.
  • Kristiansen, Lars (2008). Implicit Characterisations of Complexity Classes and Recursion in Higher Types.
  • Burgess, Mark & Kristiansen, Lars (2008). On the Complexity of Determining Autonomic Policy Constrained behaviour.
  • Kristiansen, Lars (2007). Review of S.B. Cooper's book "Computability Theory". Studia Logica: An International Journal for Symbolic Logic. ISSN 0039-3215. 86, s. 145–146.
  • Kristiansen, Lars (2007). Complexity Analysis of Programs: Methods and Challenges.
  • Kristiansen, Lars (2007). Neil Jones: The early years.
  • Kristiansen, Lars (2007). Complexity theory and Gödel's T.
  • Kristiansen, Lars (2007). Beregnbarhet, kompleksitet og typeteori.
  • Kristiansen, Lars (2006). Complexity-Theoretic Hierarchies.
  • Kristiansen, Lars & Jones, Neil D. (2006). Static Complexity Ananlysis of Programs.
  • Kristiansen, Lars (2006). Fragments of Godel's T, Complexity Classes and Rewriting Systems.
  • Kristiansen, Lars (2006). $T^-$-hierarchies and the Trade-off Theorem.
  • Kristiansen, Lars (2006). Complexity-Theoretic Hierarchies.
  • Kristiansen, Lars & Voda, Paul J. (2006). The Trade-off theorem and fragments of and Gödel's T.
  • Kristiansen, Lars (2005). Det tellbare og det overtellbare. Normat. ISSN 0801-3500. 53(3), s. 118–129.
  • Kristiansen, Lars (2005). Programmeringsspråk og kompleksitetsklasser.
  • Kristiansen, Lars (2005). Lambda-kalkyle og kompleksitetsteoretiske hierarkier.
  • Kristiansen, Lars & Aanderaa, Stål (2005). Løsninger av ligningen x^3 - y^2 = k.

Se alle arbeider i Cristin

Publisert 16. okt. 2013 12:06 - Sist endret 8. juli 2020 05:44