Lars Kristiansen

Available identifiers

zbMath Open kristiansen.larsMaRDI QIDQ207724

List of research outcomes

Publication	Date of Publication	Type
On representations of real numbers and the computational complexity of converting between such representations	2023-04-14	Paper
On interpretability between some weak essentially undecidable theories	2022-12-16	Paper
On the complexity of conversion between classic real number representations	2022-12-16	Paper
On subrecursive representation of irrational numbers: contractors and Baire sequences	2022-03-22	Paper
Reversible programming languages capturing complexity classes	2021-07-05	Paper
First-order concatenation theory with bounded quantifiers	2021-01-19	Paper
On subrecursive representability of irrational numbers, part II	2019-10-28	Paper
Decidable and undecidable fragments of first-order concatenation theory	2018-09-06	Paper
Search for good examples of Hall’s conjecture	2018-08-01	Paper
Notes on Fragments of First-Order Concatenation Theory	2018-04-17	Paper
Subrecursive Approximations of Irrational Numbers by Variable Base Sums	2018-04-15	Paper
On subrecursive representability of irrational numbers	2017-11-22	Paper
A flow calculus of mwp -bounds for complexity analysis	2015-09-17	Paper
A Preliminary Report on Search for Good Examples of Hall's Conjecture	2014-01-17	Paper
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS	2013-06-06	Paper
Non-determinism in Gödel's system \(T\)	2012-12-07	Paper
Degrees of Total Algorithms versus Degrees of Honest Functions	2012-08-14	Paper
Higher types, finite domains and resource-bounded Turing machines	2012-05-07	Paper
Streamlined subrecursive degree theory	2012-03-29	Paper
Static complexity analysis of higher order programs	2010-09-14	Paper
Complexity classes and fragments of C	2009-07-09	Paper
Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)	2009-05-08	Paper
Recursion in Higher Types and Resource Bounded Turing Machines	2008-06-19	Paper
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time	2008-06-19	Paper
The Structure of Detour Degrees	2008-05-27	Paper
Computer Science Logic	2007-06-21	Paper
Logical Approaches to Computational Barriers	2007-04-30	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
The countable and the over-countable	2006-09-11	Paper
Programming languages capturing complexity classes	2006-02-08	Paper
New Computational Paradigms	2006-01-11	Paper
New Computational Paradigms	2006-01-11	Paper
Neat function algebraic characterizations of LOGSPACE and LINSPACE	2005-06-16	Paper
Subrecursive degrees and fragments of Peano arithmetic	2002-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4503966	2000-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q4221237	1999-06-07	Paper
A jump operator on honest subrecursive degrees	1998-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4893148	1997-06-26	Paper
Notes on Interpretability between Weak First-order Theories: Theories of Sequences	N/A	Paper

Research outcomes over time

This page was built for person: Lars Kristiansen