Frank
|
Registered User
|
|
|
May 7 |
comment |
Smallest base to reach partial recursive functions as a closure of unbound search With your idea its seems fairly easy to prove that even $\mathcal{E}_0$ will do and this is what I was after to. Thank you! |
|
May 7 |
comment |
Smallest base to reach partial recursive functions as a closure of unbound search @Emil Hah, thanks. I was sloppy there. |
|
May 6 |
comment |
Smallest base to reach partial recursive functions as a closure of unbound search Thank you. I was not expecting an answer from this perspective so I need to think both the question and the answer a bit further. |
|
May 6 |
comment |
Smallest base to reach partial recursive functions as a closure of unbound search What are these two $\Delta_0$ functions that we can go with? |
|
May 6 |
asked | Smallest base to reach partial recursive functions as a closure of unbound search |
|
Apr 24 |
awarded | ● Organizer |
|
Apr 24 |
revised |
Deriving Konig’s Lemma directly from Infinite Ramsey’s Theorem for triples edited tags |
|
Apr 24 |
comment |
A General Framework for Ramsey Theory ? Are you perhaps looking for something similar to partition regularity? en.wikipedia.org/wiki/Partition_regularity |
|
Apr 11 |
awarded | ● Popular Question |
|
Apr 11 |
awarded | ● Citizen Patrol |
|
Apr 7 |
awarded | ● Popular Question |
|
Apr 4 |
comment |
Godel on recursion-theoretic hierarchies Personally I don't find asking inappropriate, but I guess this is something where opinions vary. |
|
Apr 2 |
comment |
Godel on recursion-theoretic hierarchies Have you emailed the author about the first question? |
|
Mar 26 |
comment |
Grzegorczyk-hierarchy, growth-rate and functions with finite image This looks very promising, I will go through the details before marking this an answer. Thank you. |
|
Mar 25 |
asked | Grzegorczyk-hierarchy, growth-rate and functions with finite image |
|
Mar 11 |
awarded | ● Popular Question |
|
Feb 27 |
awarded | ● Nice Question |
|
Feb 27 |
comment |
Should one attack hard problems? @quid I'm disappointed this question got closed. I take advice requests are not welcome here. Funny that on the right side there are many questions of the same style that are not closed. For example mathoverflow.net/questions/33033/… or mathoverflow.net/questions/14607/… |
|
Feb 27 |
comment |
Should one attack hard problems? Problem is that often failed attempts don't get published thus its hard to say what has been tried without success. |
|
Feb 27 |
awarded | ● Enthusiast |
|
Feb 27 |
asked | Should one attack hard problems? |
|
Feb 19 |
comment |
Recursively enumerable sets as range sets of functions in Grzegorczyk-hierarchy In case you're interested, the last theorem in Grzegorczyk's paper Some classes of recursive functions, where the hierarchy is introduced, proves that $\mathcal{E}_0$ suffices, as is shown in the answer. |
|
Dec 31 |
comment |
Math for a cake I thought of this but the problem is I just can't decide which one is a theorem. |
|
Dec 29 |
asked | Math for a cake |
