3,659 reputation
11041
bio website
location Germany
age 48
visits member for 4 years, 3 months
seen yesterday

My interests:

  • abstract structures
    (e.g. graphs, groups, polytopes, spaces, ...)

    in the course of this

  • category theory

  • model theory

  • presentations and representations
    (e.g. of abstract structures by or inside other abstract structures)

    next to this

  • philosophy
    (esp. of mathematics, science, and mind)

    especially concerned with

  • atomism
    (i.e. reductionistic or other theories referring to some kind of "atoms")

  • their refutations


Dec
8
answered Group-like structures over the integers and functions on them
Dec
8
comment Group-like structures over the integers and functions on them
As an abstract group it surely is (isomorphic) to $\mathbb{Z}$.
Dec
8
revised Group-like structures over the integers and functions on them
edited title
Dec
8
revised Group-like structures over the integers and functions on them
added 30 characters in body
Dec
8
asked Group-like structures over the integers and functions on them
Dec
2
comment Combinatorial puzzle concerning labelled equilateral triangles
What's wrong with the question? Trivial? Home-work? Ill-posed?
Dec
2
asked Combinatorial puzzle concerning labelled equilateral triangles
Nov
4
awarded  Popular Question
Oct
17
asked Graphs that are almost trees
Oct
9
awarded  Notable Question
Oct
7
revised Text books on computability
edited tags
Oct
7
revised Text books on computability
added 149 characters in body
Oct
7
comment Text books on computability
I will proceed as with other answers (to keep a comprehensive list).
Oct
7
revised Text books on computability
edited body
Oct
7
comment Text books on computability
Introductory and the next level.
Oct
7
revised Text books on computability
added 290 characters in body
Oct
7
comment Text books on computability
Bingo! I added this.
Oct
7
revised Text books on computability
edited tags
Oct
7
asked Text books on computability
Oct
3
comment Gathering nonconsecutive 1's by a Turing machine
But the proof would not be hard, would it?