4,942 reputation
1932
bio website mpi-sws.org
location Kaiserslautern, Germany
age 32
visits member for 2 years, 1 month
seen 14 hours ago

PhD student at MPI-SWS.


19h
reviewed Approve suggested edit on Find last n for which 2^n has a 0.
Apr
11
reviewed Edit suggested edit on If $2$ divides a number $a$, does $2^n$ divide $a$ ? $n$ is any integar
Apr
11
revised If $2$ divides a number $a$, does $2^n$ divide $a$ ? $n$ is any integar
improved formatting and some grammar fixes
Apr
6
reviewed Approve suggested edit on Confidence interval for n=1, unknown standard deviation
Apr
2
reviewed Edit suggested edit on How can a piece of A4 paper be folded in exactly three equal parts?
Apr
2
revised How can a piece of A4 paper be folded in exactly three equal parts?
Added photo explanation.
Mar
31
reviewed Approve suggested edit on What is a hypersurface ring and why is it Gorenstein?
Mar
30
reviewed Approve suggested edit on Geometric reducedness (integral) versus reducedness (integral)
Mar
30
reviewed Approve suggested edit on Why would you expand a square wave in a Fourier series?
Mar
26
reviewed Approve suggested edit on Invertible matrices and row equivalence
Mar
25
reviewed Approve suggested edit on About the definition of fixed-point combinators
Mar
23
comment Why is this Goldbach's Conjecture Proof Wrong?
As a first comment, I don't understand what your proof of Lemma 2 shows. In particular, how is "L cannot be a prime" a contradiction?
Mar
17
answered Program with no intermediary states
Mar
17
comment Program with no intermediary states
Oh, wait. You may need higher-order functions; see the answer.
Mar
17
comment Program with no intermediary states
As long as you can give effective semantics to your model/programming language, yes. Does this answer your question?
Mar
17
comment Program with no intermediary states
To be more concrete, suppose you have big-step semantics for an imperative programming language without function calls. Then for each statement, we get a (computable) function mapping a variable context to a variable context. Chain all these functions, and you have a representation of your program as a sequence of function applications.
Mar
17
comment Program with no intermediary states
What is your computation model? If you allow any model and provide denotational semantics, the answer is "trivially, yes": Just take the function induced by the denotational semantics. Edit: This also works with other formal semantics, e.g., small-step operational semantics or natural semantics.
Mar
13
reviewed Approve suggested edit on Showing a Problem Is Undecidable
Mar
13
awarded  Proofreader
Mar
13
reviewed Approve suggested edit on General versions of (Second part of) Fundamental Theorem of Calculus