Current Research Information SysTem In Norway
 
 

 Norsk versjon


 
Mainpage
Research results/NVI
Researchers
Projects
Research units
Log in
About Cristin
 
 
   
Back to search     Short format     Full format    
Export to


Showing results 1-50 of 120 << Previous 1 2 3    Next >>

2021
1 Kristiansen, Lars.
Classic representations of irrational numbers seen from a computability and complexity-theoretic perspective. Logic Seminar, National University of Singapore; 2021-03-31
UiO Untitled
 
2 Kristiansen, Lars.
Implicit characterisations of complexity classes by inherently reversible programming languages. SCOT: A Seminar on Semantic and Formal Approaches to Complexity; 2021-06-22
UiO Untitled
 
3 Kristiansen, Lars.
On Representations of Irrational Numbers: A Degree Structure. CCA 2021: Eighteenth International Conference on Computability and Complexity in Analysis; 2021-07-26 - 2021-07-28
UiO Untitled
 
4 Kristiansen, Lars.
On subrecursive representation of irrational numbers: Contractors and Baire sequences. Lecture Notes in Computer Science (LNCS) 2021 ;Volume 12813.
UiO Untitled
 
5 Kristiansen, Lars.
On subrecursive representation of irrational numbers: Contractors and Baire sequences.. Computability in Europe 2021: Connecting with Computability; 2021-07-05 - 2021-07-09
UiO Untitled
 
2020
6 Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank.
Computable Irrational Numbers with Representations of Surprising Complexity. Annals of Pure and Applied Logic 2020 ;Volume 172.(2)
UiO Untitled
 
7 Kristiansen, Lars.
Reversible Programming Languages Capturing Complexity Classes. RC 2020 (Reversible Computing 2020); 2020-07-09 - 2020-07-10
UiO Untitled
 
8 Kristiansen, Lars.
On Interpretability Between some Weak Essentially Undecidable Theories. CiE 2020 (Computability in Europa); 2020-06-29 - 2020-07-02
UiO Untitled
 
9 Kristiansen, Lars.
Reversible programming languages capturing complexity classes.. Lecture Notes in Computer Science (LNCS) 2020 ;Volume 12227. p. 111-127
UiO Untitled
 
10 Kristiansen, Lars; Murwanashyaka, Juvenal.
First-Order Concatenation Theory with Bounded Quantifiers. Archive for Mathematical Logic 2020 ;Volume 60.(1-2) p. 77-104
UiO Untitled
 
11 Kristiansen, Lars; Murwanashyaka, Juvenal.
First-Order Concatenation Theory with Bounded Quantifiers (Preprint). arXiv.org 2020 p. -
UiO Untitled
 
12 Kristiansen, Lars; Murwanashyaka, Juvenal.
On Interpretability between some weak essentially undecidable theories. Lecture Notes in Computer Science (LNCS) 2020 ;Volume 12098. p. 63-74
UiO Untitled
 
13 Kristiansen, Lars; Simonsen, Jakob Grue.
On the Complexity of Conversion Between Classic Real Number Representations. Lecture Notes in Computer Science (LNCS) 2020 ;Volume 12098. p. 75-86
UiO Untitled
 
2019
14 Kristiansen, Lars.
Best Approximations, Contractions Maps and Continued Fractions. International Workshop on Proof, Computation, Complexity, PCC 2019; 2019-07-15 - 2019-07-19
UiO Untitled
 
15 Kristiansen, Lars.
On Subrecursive Representability of Irrational Numbers: Continued Fractions and Contraction maps.. Sixteenth International Conference on Computability and Complexity in Analysis; 2019-07-08 - 2019-07-11
UiO Untitled
 
2018
16 Aanderaa, Stål; Kristiansen, Lars; Ruud, Hans-Kristian.
Search for Good Examples of Hall's Conjecture. Mathematics of Computation 2018 ;Volume 87.(314) p. 2903-2914
UiO Untitled
 
17 Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank.
On General Sum Approximations of Irrational Numbers. I: Sailing Routes in the World of Computation. Springer Nature 2018 ISBN 978-3-319-94417-3. p. 194-203
UiO Untitled
 
18 Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank.
Subrecursive Approximations of Irrational Numbers by Variable Base Sums. arXiv.org 2018
UiO Untitled
 
19 Kristiansen, Lars.
Decidable and Undecidable Fragments of First-Order Concatenation Theory.. CiE 2018: Computability in Europe 2015: Sailing Routes in the World of Computation; 2018-07-30 - 2018-08-03
UiO Untitled
 
20 Kristiansen, Lars.
First-order concatenation vs. first-order number theory.. Workshop: Proofs and Computation; 2018-07-02 - 2018-07-06
UiO Untitled
 
21 Kristiansen, Lars.
On b-adic Representations of Irrational Numbers.. PCC 2018 -- International Workshop on Proof, Computation, Complexity; 2018-07-18 - 2018-07-19
UiO Untitled
 
22 Kristiansen, Lars.
On General Sum Approximations of Irrational Numbers.. CiE 2018: Computability in Europe 2015: Sailing Routes in the World of Computation; 2018-07-30 - 2018-08-03
UiO Untitled
 
23 Kristiansen, Lars.
On subrecursive representability of irrational numbers, part II. Computability - The Journal of the Assosiation 2018 ;Volume 8.(1) p. 43-65
UiO Untitled
 
24 Kristiansen, Lars; Murwanashyaka, Juvenal.
Decidable and Undecidable Fragments of First-Order Concatenation Theory. I: Sailing Routes in the World of Computation. Springer Nature 2018 ISBN 978-3-319-94417-3. p. 244-253
UiO Untitled
 
25 Kristiansen, Lars; Murwanashyaka, Juvenal.
Notes on Fragments of First-Order Concatenation Theory. arXiv.org 2018
UiO Untitled
 
2017
26 Kristiansen, Lars.
On Resource Analysis of Imperative Programs. DICE-FOPARA 2017, 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis.; 2017-04-22 - 2017-04-23
UiO Untitled
 
27 Kristiansen, Lars.
On Resource Analysis of Imperative Programs. Electronic Proceedings in Theoretical Computer Science (EPTCS) 2017 ;Volume 248.
UiO Untitled
 
28 Kristiansen, Lars.
On subrecursive representability of irrational numbers. Computability - The Journal of the Assosiation 2017 ;Volume 6.(3) p. 249-276
UiO Untitled
 
2016
29 Kristiansen, Lars.
On Subrecursive Representability of Irrational Numbers. Workshop on Computability Theory 2016; 2016-07-04 - 2016-07-05
UiO Untitled
 
30 Kristiansen, Lars.
On Subrecursive Representability of Irrational Numbers.. PCC 2016, - International Workshop on Proof, Computation, Complexity; 2016-05-05 - 2016-05-06
UiO Untitled
 
31 Kristiansen, Lars.
On subrecursive representability of irrational numbers.. Computability - The Journal of the Assosiation 2016 ;Volume 6. p. 249-276
UiO Untitled
 
32 Kristiansen, Lars.
Subrecursive Sum Approximations of Irrational Numbers. CiE 2016 - Computability in Europe 2016: Pursuit of the Universal; 2016-06-27 - 2016-07-01
UiO Untitled
 
2015
33 Kristiansen, Lars.
Subrecursive Dedekind and Cauchy reals.. CiE 2015 -- Computability in Europa; 2015-06-29 - 2015-07-03
UiO Untitled
 
34 Leary, Christopher C.; Kristiansen, Lars.
A Friendly Introduction to Mathematical Logic. , Geneseo, NY: Milne Library, SUNY Geneseo 2015 (ISBN 978-1-942341-07-9) 380 p.
UiO Untitled
 
2014
35 Kristiansen, Lars; Aanderaa, Stål; Ruud, Hans-Kristian.
A Preliminary Report on Search for Good Examples of Hall's Conjecture. arXiv.org 2014
UiO Untitled
 
2012
36 Ben-Amram, Amir; Kristiansen, Lars.
On the edge of decidability in complexity analysis of loop programs. International Journal of Foundations of Computer Science 2012 ;Volume 23.(7) p. 1451-1464
UiO Untitled
 
37 Kristiansen, Lars.
Degrees of Total Algorithms versus Degrees of Honest Functions. PCC 2012 - International Workshop on Proof, Computation, Complexity; 2012-08-17 - 2012-08-18
UiO Untitled
 
38 Kristiansen, Lars.
Degrees of Total Algorithms versus Degrees of Honest Functions. Lecture Notes in Computer Science (LNCS) 2012 ;Volume 7318. p. 442-431
UiO Untitled
 
39 Kristiansen, Lars.
Higher Types, Finite Domains and Resource-bounded Turing Machines. Journal of Logic and Computation 2012 ;Volume 22.(2) p. 281-304
UiO Untitled
 
40 Kristiansen, Lars; Lubarsky, Robert; Schlage-Puchta, J.-C.; Weiermann, Andreas.
On the structure of honest elementary degrees. I: The Infinity Project.A 2009–2011 Research Programme. Barcelona, Spain: Centre de Recerca Matematica 2012 ISBN 978-84-616-3307-4. p. 255-279
UiO Untitled
 
41 Kristiansen, Lars; Mender, Bedeho.
Non-determinism in Gödel's System T. Theory of Computing Systems 2012 ;Volume 51.(1) p. 85-105
UiO Untitled
 
42 Kristiansen, Lars; Schlage-Puchta, Jan-Christoph; Weiermann, Andreas.
Streamlined subrecursive degree theory. Annals of Pure and Applied Logic 2012 ;Volume 163.(6) p. 698-716
UiO Untitled
 
2011
43 Ben-Amram, Amir; Kristiansen, Lars.
Decidable and undecidable problems related to complexity analysis of loop programs. Computability in Europe 2011; 2011-06-27 - 2011-07-02
UiO Untitled
 
44 Kristiansen, Lars.
Honest subrecursive degree theory and provability in Peano Arithmetic. PCC 2011, - International Workshop on Proof, Computation, Comlexity; 2011-06-06 - 2011-09-05
UiO Untitled
 
45 Kristiansen, Lars.
New computational paradigms. Studia Logica: An International Journal for Symbolic Logic 2011 ;Volume 97.(2) p. 313-316
UiO Untitled
 
46 Kristiansen, Lars.
Review of the book "New Computational Paradigms (eds.: Cooper, Löwe, Sorbi)". Studia Logica: An International Journal for Symbolic Logic 2011 ;Volume 97. p. 313-316
UiO Untitled
 
47 Kristiansen, Lars.
Subrecursive degrees of honest functions and provably recursive functions. Infinity Conference; 2011-07-18 - 2011-07-22
UiO Untitled
 
48 Kristiansen, Lars; Mender, Bedeho.
Non-determinism in Gödel's system T. Theory of Computing Systems 2011
UiO Untitled
 
2010
49 Avery, James; Kristiansen, Lars; Moyen, Jean-Yves.
Static Complexity Analysis of Higher Order Programs. Lecture Notes in Computer Science (LNCS) 2010 ;Volume 6324. p. 84-99
UiO Untitled
 
50 Kristiansen, Lars.
Higher types, finite domains and resource bounded Turing machines. Journal of Logic and Computation 2010 p. -
UiO Untitled
 
    Show next list