3,631 reputation
11041
bio website
location Germany
age 48
visits member for 4 years, 2 months
seen 2 days ago

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


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?
Oct
3
comment Gathering nonconsecutive 1's by a Turing machine
Thank you, Yuval. But this implies that there are no "free" pure 2-symbol Turing machines (that allow to follow this convention), right? (By the way: one new symbol would suffice, wouldn't it?)
Oct
2
comment Gathering nonconsecutive 1's by a Turing machine
Does the (first) link work better know? Or didn't you mean it technically? (The background is Cooper's convention. And he explicitly aims at composing computable functions.)
Oct
2
revised Gathering nonconsecutive 1's by a Turing machine
deleted 161 characters in body
Oct
2
asked Gathering nonconsecutive 1's by a Turing machine
Oct
2
revised Input and output of a Turing machine
added 255 characters in body
Sep
30
comment Input and output of a Turing machine
I believe to know which textbooks you mean with Kleene's and Davis', but which one do yo mean with Hermes'?
Sep
30
comment Input and output of a Turing machine
+1 for the hint to Wang coding. (Could you explain, why you think that it's not a real problem.)