Christine Gaßner,  University of Greifswald,  gassnerc@uni-greifswald.de

Gaßner: About the term algorithm: The first pages of the habilitation thesis "Gelöste und offene P-NP-Probleme über verschiedenen Strukturen" ("Solved and open P versus NP problems over various structures") 2011. 

Gaßner: An introduction to a model of abstract computation: The BSS-RAM model. In: Adrian Rezus (ed.), Contemporary Logic and Computing, College Publications, London (2020) [Landscapes in Logic  1], pp. 574–603. (researchgate)

 Gaßner:  Deterministic Operators for BSS RAM's I (extended abstract).  Preprint 2017

 Gaßner:  Computation over Algebraic Structures and a Classification of Undecidable Problems. online (MSCS)

See also: publications

2023

   Gaßner: Universelle Maschinen und universelle Relationen (Greifswald, Arbeitstreffen 2023)

2021

  Gaßner, A. Pauly, and F. Steinberg: Computing Measure as a Primitive Operation in Real Number Computation (conference paper, CSL 2021) 

2018

   Gaßner, A. Pauly, and F. Steinberg: Comparing integrability and measurability in different models of computation (abstract, CiE 2018)

2017

   Gaßner: Effective Descriptions of Mathematical Objects and the BSS-RAM Model (slides, Kloster, Arbeitstreffen 2017)

2016

   Gaßner: BSS RAMs with nu-Oracle and the Axiom of Choice (slides, Hamburg, Colloquium Logicum 2016)  

   Gaßner: BSS RAMs with Operators for Several Measures (slides, Kloster, Arbeitstreffen 2016)

   P. F. Valencia Vizcaíno: Operators for Computation over Partially Ordered Structures (Oaxaca, Mexico 2016)

2015

   Gaßner: Hierarchies of Decision Problems over Algebraic Structures Defined by Quantifiers (slides, Kochel, CCC 2015)

   Gaßner and P. F. Valencia Vizcaíno: Operators for BSS RAM's (slides, CCA 2015)

2012

   Gaßner: Analytically Computable Functions (slides, Greifswald, Arbeitstreffen 2012)

   Gaßner: A Strong Turing Reduction for Additive BSS RAMs (slides, Cambridge, CCA 2012)

   Gaßner: Computation over Algebraic Structures and Finitary Domains (slides, Trier, CCC 2012)

   Gaßner: Computation over Algebraic Structures and the Turing Reduction (slides, Trier, CCC 2012)

2011

   Gaßner: Comparison of Models of Computation over the Reals (slides, Greifswald, Arbeitstreffen 2011)

   Gaßner: A General BSS Model over Arbitrary Structures (slides, Cape Town, CCA 2011)

2010

   Gaßner: Logische Aspekte bei der Betrachtung von Berechnungsmodellen über den reellen Zahlen (slides, Siegen, 2010, Colloquium)

   Gaßner: Komplexitatsbetrachtungen uber beliebigen Strukturen (slides, Bonn 2010, Colloquium)

   Gaßner: Degrees of Unsolvability for Additive BSS Machines (slides, Greifswald, Arbeitstreffen 2010)

   Gaßner: Additive BSS Maschinen (slides, Greifswald, Arbeitstreffen 2010)

2009 

   Gaßner: Relativizations of the P =? DNP Question for the BSS Model (slides, Ljubljana, CCA 2009)

   Gaßner: Hierarchies below the Halting Problem for Additive Machines (slides, Heidelberg, CiE 2009)

   Gaßner: Relativizations of the P =? DNP Question over the Complex Numbers (slides, Cologne, CCC 2009)

   T. Zerjatke: Solving a PSPACE-Complete Problem with DNA Computing (CiE 2009, Diploma thesis)

2008

   Gaßner: On Relativizations of the P =? NP Question for Several Structures (slides, CCA 2008)

   Gaßner: Berechenbarkeit über algebraischen Strukturen (Greifswald, 2008, Colloquium)

   Gaßner: Uniforme Berechenbarkeit uber beliebigen Strukturen (Siegen, 2008, Colloquium)

   Gaßner: Computation over Groups (conference paper, slides, CiE 2008, researchgate)

2007 

   Gaßner: P = NP for Expansions Derived from Some Oracles (conference paper, slides, CiE 2007, researchgate)

2006

   Gaßner: A Structure with P = NP (conference paper, CiE 2006, researchgate)

   Gaßner: Expansions of Structures with P = NP (conference paper, CiE 2006, researchgate)

2005

   Gaßner: Structures with P = NP with Respect to the Uniform Model of Computation (slides, EPIT 2005)

2004 

   Gaßner: A Structure of Finite Signature with P = NP (abstract & slides, Dagstuhl 2004)

1996

   Gaßner: An NP-Complete Problem for Linear Real Machines (abstract, slides, WCCL 1996. 1)

2010

   Workshop Logical approaches to barriers in computing and complexity (programme, abstract booklet)

Logic and Theoretical Computer Science: Theory of Computability over Algebraic Structures  (english, deutsch)

A question: Is it possible to include other operators to generalize BSS-RAMs?

My answer: I think that various extensions are possible and could be made if it is to be expected that the new model will lead to a better understanding of certain mathematical or other relationships.

Updated on December 8, 2024

_{Die Seite ist im Aufbau.}