« first day (1847 days earlier)      last day (2689 days later) » 

11:50 AM
Hello @ThomasKlimpel
 
@Evinda Hi Evinda. I'm a bit busy at this very second. I'm reading a paper and try to understand the details of a proof. Maybe I will have understood in in 10 minutes, or maybe I will take a bit longer, but I would like to first finish that task. (It is unclear whether this proof is correct or not, so it would really be nice if I understood the details.)
 
@ThomasKlimpel Ok, I will wait. :)
 
12:49 PM
@Evinda So, now I understand the details of the proof. Still not sure whether it is really correct, but that is a different story.
 
 
1 hour later…
1:51 PM
@ThomasKlimpel A ok. I wanted to ask you if you are familiar with the following two topics:

- Boolean algebra
- Algebraic complexity

I will have a presentation and the topic should be anything wide, interesting and scientic and I have thought of the above two topic. What do you think of them?
 
2:04 PM
@Evinda I do know Boolean algebra. There are many things one can say about them, so they are certainly wide. Not sure whether they are also interesting and scientific. I am less sure whether I do know algebraic complexity. It is certainly interesting, but maybe a bit advanced for a general audience. Who is your audience anyway?
 
@ThomasKlimpel The audience is my professor of computability theory and my classmates of this subject. What specific could I present about Boolean algebra? Can you suggest me a possible structure?
 
You could go with something like chapter 8 "Boolesche Funktionen und Schaltkreise" from "Elemente der diskreten Mathematik: Zahlen Und Zählen, Graphen Und Verbände". What is your native language?
 
My mother is german that's why I speak fluently german.
But is there an online version so that I can take a look at it? @ThomasKlimpel
 
2:20 PM
@Evinda Probably not, but then you can read at least the table of content to get a feeling for the possible "elementary" topics for Boolean algebra. Then we can look for online resources covering them. Let me try to quote details here.
In chapter 7: "7.8 Boolesche Verbände", "7.9 Boolesche Ringe", "7.10 Der allgemeine Darstellungssatz von Stone". In chapter 8: "8.1 Shannons obere Schranke für die Anzahl der Gatter" "8.2 Die untere Schranke von Shannon", "8.3 Die obere Schranke von Lupanov".
 
2:54 PM
@ThomasKlimpel Ok. Are there online resources similar to the book?
 
@Evinda Probably. For each separate topic, it should be easy to find online (or offline) resources.
Googling for "upper bound of Lupanov" gave me for example cse.iitm.ac.in/~jayalal/teaching/CS6840/2012/lecture35.pdf. Googling for "stone representation theorem" gave me
In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of the 20th century. The theorem was first proved by Marshall H. Stone (1936), and thus named in his honor. Stone was led to it by his study of the spectral theory of operators on a Hilbert space. == Stone spaces == Each Boolean algebra B has an associated topological space, denoted here S(B), called its Stone space. The points in S(B) are the ultrafilters on...
This doesn't mean that you should talk about Boolean algebras. It just suggests some possible topics you could talk about, if you want to talk about Boolean algebras.
 
 
5 hours later…
8:12 PM
@ThomasKlimpel Do you know this book: http://www.gbv.de/dms/ilmenau/toc/180332198.PDF ?

If so, are the boolean functions presented good in 8.2.6 ?
 
9:07 PM
@Evinda I once liked that book, but that was in the last century. I don't have access to a copy of that book right now. If you have access to a copy of that book, why don't you just read that section 8.2.6? Then either you will find out that it is not helpful for you, or else you already learned a basis to decide whether you want to talk about Boolean algebras and Boolean functions.
 
 
2 hours later…
10:48 PM
@ThomasKlimpel Ok, I will read it.
What do you think of Computerunterstütztes Modellieren mit Musiknetzen and
Komplexität der Geographie as presentation topics?
 
11:29 PM
@Evinda Well, "Computerunterstütztes Modellieren mit Musiknetzen" would probably be challenging. Petri nets could be considered to be part of computability theory if really required, but there would be too many "practical" issues, and maybe also too many new and foreign concepts. But "Komplexität der Geographie" sounds reasonable. Why did you take German texts? Will the presentation be in German?
 

« first day (1847 days earlier)      last day (2689 days later) »