2023
|
1. |
Kristiansen, Lars. On a Lattice of Degrees of Representations of Irrational Numbers. CiE 2023 (Computability in Europa); 2023-07-24 - 2023-07-28 UiO
Untitled
|
|
2. |
Kristiansen, Lars; Ben-Amram, Amir; Simonsen, Jakob Grue. On representations of real numbers and the computational complexity of converting between such representations. arXiv 2023 UiO
Untitled
|
2022
|
3. |
Kristiansen, Lars. On Various Week First-Order Theories. Eleventh Scandinavian Logic Symposium (SLSS 2022); 2022-06-17 - 2022-06-19 UiO
Untitled
|
2021
|
4. |
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
|
|
5. |
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
|
|
6. |
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
|
|
7. |
Kristiansen, Lars. On subrecursive representation of irrational numbers: Contractors and Baire sequences. Lecture Notes in Computer Science (LNCS) 2021 ;Volum 12813. s. 308-317 UiO
Untitled
|
|
8. |
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
|
|
9. |
Kristiansen, Lars. Reversible Computing and Implicit Computational Complexity. Science of Computer Programming 2021 ;Volum 213. UiO
Untitled
|
2020
|
10. |
Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank. Computable Irrational Numbers with Representations of Surprising Complexity. Annals of Pure and Applied Logic 2020 ;Volum 172.(2) UiO
Untitled
|
|
11. |
Kristiansen, Lars. Reversible Programming Languages Capturing Complexity Classes. RC 2020 (Reversible Computing 2020); 2020-07-09 - 2020-07-10 UiO
Untitled
|
|
12. |
Kristiansen, Lars. On Interpretability Between some Weak Essentially Undecidable Theories. CiE 2020 (Computability in Europa); 2020-06-29 - 2020-07-02 UiO
Untitled
|
|
13. |
Kristiansen, Lars. Reversible programming languages capturing complexity classes.. Lecture Notes in Computer Science (LNCS) 2020 ;Volum 12227. s. 111-127 UiO
Untitled
|
|
14. |
Kristiansen, Lars; Murwanashyaka, Juvenal. First-Order Concatenation Theory with Bounded Quantifiers. Archive for Mathematical Logic 2020 ;Volum 60.(1-2) s. 77-104 UiO
Untitled
|
|
15. |
Kristiansen, Lars; Murwanashyaka, Juvenal. First-Order Concatenation Theory with Bounded Quantifiers (Preprint). arXiv.org 2020 s. - UiO
Untitled
|
|
16. |
Kristiansen, Lars; Murwanashyaka, Juvenal. On Interpretability between some weak essentially undecidable theories. Lecture Notes in Computer Science (LNCS) 2020 ;Volum 12098. s. 63-74 UiO
Untitled
|
|
17. |
Kristiansen, Lars; Simonsen, Jakob Grue. On the Complexity of Conversion Between Classic Real Number Representations. Lecture Notes in Computer Science (LNCS) 2020 ;Volum 12098. s. 75-86 UiO
Untitled
|
2019
|
18. |
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
|
|
19. |
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
|
20. |
Aanderaa, Stål; Kristiansen, Lars; Ruud, Hans-Kristian. Search for Good Examples of Hall's Conjecture. Mathematics of Computation 2018 ;Volum 87.(314) s. 2903-2914 UiO
Untitled
|
|
21. |
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. s. 194-203 UiO
Untitled
|
|
22. |
Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank. Subrecursive Approximations of Irrational Numbers by Variable Base Sums. arXiv.org 2018 UiO
Untitled
|
|
23. |
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
|
|
24. |
Kristiansen, Lars. First-order concatenation vs. first-order number theory.. Workshop: Proofs and Computation; 2018-07-02 - 2018-07-06 UiO
Untitled
|
|
25. |
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
|
|
26. |
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
|
|
27. |
Kristiansen, Lars. On subrecursive representability of irrational numbers, part II. Computability - The Journal of the Assosiation 2018 ;Volum 8.(1) s. 43-65 UiO
Untitled
|
|
28. |
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. s. 244-253 UiO
Untitled
|
|
29. |
Kristiansen, Lars; Murwanashyaka, Juvenal. Notes on Fragments of First-Order Concatenation Theory. arXiv.org 2018 UiO
Untitled
|
2017
|
30. |
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
|
|
31. |
Kristiansen, Lars. On Resource Analysis of Imperative Programs. Electronic Proceedings in Theoretical Computer Science (EPTCS) 2017 ;Volum 248. UiO
Untitled
|
|
32. |
Kristiansen, Lars. On subrecursive representability of irrational numbers. Computability - The Journal of the Assosiation 2017 ;Volum 6.(3) s. 249-276 UiO
Untitled
|
2016
|
33. |
Kristiansen, Lars. On Subrecursive Representability of Irrational Numbers. Workshop on Computability Theory 2016; 2016-07-04 - 2016-07-05 UiO
Untitled
|
|
34. |
Kristiansen, Lars. On Subrecursive Representability of Irrational Numbers.. PCC 2016, - International Workshop on Proof, Computation, Complexity; 2016-05-05 - 2016-05-06 UiO
Untitled
|
|
35. |
Kristiansen, Lars. On subrecursive representability of irrational numbers.. Computability - The Journal of the Assosiation 2016 ;Volum 6. s. 249-276 UiO
Untitled
|
|
36. |
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
|
37. |
Kristiansen, Lars. Subrecursive Dedekind and Cauchy reals.. CiE 2015 -- Computability in Europa; 2015-06-29 - 2015-07-03 UiO
Untitled
|
|
38. |
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 s. UiO
Untitled
|
2014
|
39. |
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
|
40. |
Ben-Amram, Amir; Kristiansen, Lars. On the edge of decidability in complexity analysis of loop programs. International Journal of Foundations of Computer Science 2012 ;Volum 23.(7) s. 1451-1464 UiO
Untitled
|
|
41. |
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
|
|
42. |
Kristiansen, Lars. Degrees of Total Algorithms versus Degrees of Honest Functions. Lecture Notes in Computer Science (LNCS) 2012 ;Volum 7318. s. 442-431 UiO
Untitled
|
|
43. |
Kristiansen, Lars. Higher Types, Finite Domains and Resource-bounded Turing Machines. Journal of Logic and Computation 2012 ;Volum 22.(2) s. 281-304 UiO
Untitled
|
|
44. |
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. s. 255-279 UiO
Untitled
|
|
45. |
Kristiansen, Lars; Mender, Bedeho. Non-determinism in Gödel's System T. Theory of Computing Systems 2012 ;Volum 51.(1) s. 85-105 UiO
Untitled
|
|
46. |
Kristiansen, Lars; Schlage-Puchta, Jan-Christoph; Weiermann, Andreas. Streamlined subrecursive degree theory. Annals of Pure and Applied Logic 2012 ;Volum 163.(6) s. 698-716 UiO
Untitled
|
2011
|
47. |
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
|
|
48. |
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
|
|
49. |
Kristiansen, Lars. New computational paradigms. Studia Logica: An International Journal for Symbolic Logic 2011 ;Volum 97.(2) s. 313-316 UiO
Untitled
|
|
50. |
Kristiansen, Lars. Review of the book "New Computational Paradigms (eds.: Cooper, Löwe, Sorbi)". Studia Logica: An International Journal for Symbolic Logic 2011 ;Volum 97. s. 313-316 UiO
Untitled
|