3,693 reputation
1939
bio website
location Germany
age 48
visits member for 4 years
seen 1 hour 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


Sep
8
comment Turing machines that compute $\pi$
And there should be no way to extrapolate from advanced (= "higher-level") algorithms down to Turing machines?
Sep
8
awarded  Yearling
Sep
2
comment Turing machines that compute $\pi$
I tried to talk about the number of steps needed to compute the $k+1$-th digit after having computed the $k$-th digit.
Sep
2
revised Turing machines that compute $\pi$
added 45 characters in body
Sep
1
asked Turing machines that compute $\pi$
Sep
1
revised Arithmetic Turing machines
deleted 2 characters in body
Aug
31
revised Arithmetic Turing machines
added 4 characters in body
Aug
31
revised Arithmetic Turing machines
added 72 characters in body
Aug
31
asked Arithmetic Turing machines
Aug
30
accepted Number of $1$s in the binary representation of $n$
Aug
28
comment Number of $1$s in the binary representation of $n$
Yes, looks good!
Aug
28
comment Number of $1$s in the binary representation of $n$
You are right! I changed it.
Aug
28
revised Number of $1$s in the binary representation of $n$
added 180 characters in body
Aug
28
revised Number of $1$s in the binary representation of $n$
added 180 characters in body
Aug
28
comment Number of $1$s in the binary representation of $n$
Sounds interesting. If this definition works, the next question would be: Is there a first order definition?
Aug
28
comment Number of $1$s in the binary representation of $n$
No, I didn't, but I did not want to allow $\log$, etc. but only $+$, $\cdot$ and exponentation, eventually.
Aug
28
asked Number of $1$s in the binary representation of $n$
Aug
22
comment Extensions by recursive definitions
Please note that I restricted my question to theories which allow recursive definitions (which implies that they have induction axioms?)
Aug
22
comment Extensions by recursive definitions
I mean definitions like that of addition in first-order Peano arithmetic: in the form of two axioms which together with the induction schema yield all relevant properties of addition. (That means: recursive definitions work only in the presence of induction?)
Aug
22
asked Extensions by recursive definitions