Track the most recent social changes to the community on this page.
Filters
23 May 2022

19:47Binary198 (talk  contribs) edited a reply to the comment The further this community moves, the less I seem to understand what it's trying to do anymore. I ne... on the article Binary198/Additive inaccessible OCF but unsus: I'm trying to make an OCF using inaccessible but satisfying "nicer equalities", more similar to Buch... (view)

19:44Binary198 (talk  contribs) replied to the comment The further this community moves, the less I seem to understand what it's trying to do anymore. I ne... on the article Binary198/Additive inaccessible OCF but unsus: I'm trying to make an OCF using inaccessible but satisfying "nicer equalities", more similar to Buch... (view)

18:18Tsskyx (talk  contribs) commented on the article User_blog:Binary198/Additive inaccessible OCF but unsus: The further this community moves, the less I seem to understand what it's trying to do anymore. I ne... (view)

01:23P進大好きbot (talk  contribs) commented on the article User_blog:Ubersketch/Should ThaAwesome's notations and numbers be removed from mainspace?: > My reasoning is that it's very clearly illdefined Concerning this point, deleting a number due to... (view)

01:10P進大好きbot (talk  contribs) replied to the comment I am not happy for you to call me in that way again and again, as if I were wrong. I clarified that ... on the article TrialPurpleCube/Redacted (don't ask): @Binary198 Now you see that the user added an unsourced description again. I reverted it, by citing ... (view)
22 May 2022

21:09TrialPurpleCube (talk  contribs) replied to the comment It looks nice, but has minor issues: "All ψs in this post are Multivariable Buchholz unless otherwi... on the article TrialPurpleCube/Bad OCFs I came up with: Thank you for the feedback. I'll fix the typos (view)

07:37P進大好きbot (talk  contribs) replied to the comment I am not happy for you to call me in that way again and again, as if I were wrong. I clarified that ... on the article TrialPurpleCube/Redacted (don't ask): Hmm... I see. Thank you. (view)

07:13Binary198 (talk  contribs) replied to the comment I am not happy for you to call me in that way again and again, as if I were wrong. I clarified that ... on the article TrialPurpleCube/Redacted (don't ask): @P進大好きbot Honestly, I can't tell why they repeat this behaviour against you, so I have asked... (view)

04:28P進大好きbot (talk  contribs) commented on the article User_blog:TrialPurpleCube/Redacted (don't ask): I am not happy for you to call me in that way again and again, as if I were wrong. I clarified that ... (view)
21 May 2022

11:39Binary198 (talk  contribs) replied to the comment It looks nice, but has minor issues: "All ψs in this post are Multivariable Buchholz unless otherwi... on the article TrialPurpleCube/Bad OCFs I came up with: :) (view)

11:37P進大好きbot (talk  contribs) replied to the comment It looks nice, but has minor issues: "All ψs in this post are Multivariable Buchholz unless otherwi... on the article TrialPurpleCube/Bad OCFs I came up with: I did not know the name of my OCF. (view)

11:29Binary198 (talk  contribs) replied to the comment It looks nice, but has minor issues: "All ψs in this post are Multivariable Buchholz unless otherwi... on the article TrialPurpleCube/Bad OCFs I came up with: > "multivariable Buchholz" is not a standard name of an existing OCF as far as I know in this commun... (view)

03:23P進大好きbot (talk  contribs) commented on the article User_blog:TrialPurpleCube/Bad OCFs I came up with: It looks nice, but has minor issues: "All ψs in this post are Multivariable Buchholz unless otherwi... (view)
20 May 2022

12:24B4423 (talk  contribs) commented on the article User_blog:MultiSoul/Mess Of Illions (final page of illions on my blog post): E (view)
16 May 2022

14:42Divinemakyr (talk  contribs) commented on the article User_blog:Trakaplex/My Extended SI Prefixes: Nice. (view)

02:47P進大好きbot (talk  contribs) replied to the comment It looks cool, but I do not understand what you precisely meant by {α<Ω_ββ∈O_ν^n∧β<ν}, b... on the article Ubersketch/Ubersketch attempts to make an additive inaccessible OCF: By the way, when you fix an issue, could you explain the intention of the correction next time? It d... (view)

02:44P進大好きbot (talk  contribs) edited a reply to the comment It looks cool, but I do not understand what you precisely meant by {α<Ω_ββ∈O_ν^n∧β<ν}, b... on the article Ubersketch/Ubersketch attempts to make an additive inaccessible OCF: Although {α<Ω_ββ∈O_ν^n∧β<ν} is partially corrected, it is not following the standard con... (view)

02:41P進大好きbot (talk  contribs) replied to the comment It looks cool, but I do not understand what you precisely meant by {α<Ω_ββ∈O_ν^n∧β<ν}, b... on the article Ubersketch/Ubersketch attempts to make an additive inaccessible OCF: Although {α<Ω_ββ∈O_ν^n∧β<ν} is corrected, the other one has not been corrected. In addit... (view)

02:04Ubersketch (talk  contribs) replied to the comment It looks cool, but I do not understand what you precisely meant by {α<Ω_ββ∈O_ν^n∧β<ν}, b... on the article Ubersketch/Ubersketch attempts to make an additive inaccessible OCF: Ok, I will change that. (view)

01:12P進大好きbot (talk  contribs) commented on the article User_blog:Ubersketch/Ubersketch attempts to make an additive inaccessible OCF: It looks cool, but I do not understand what you precisely meant by {α<Ω_ββ∈O_ν^n∧β<ν}, b... (view)

01:07P進大好きbot (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: What do you think about the other part? (view)
15 May 2022

19:01Ubersketch (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: Ok then, I will use \(\psi_0\) instead then. (view)

08:4112AbBa (talk  contribs) commented on the article User_blog:Ytosk/Small improvements to bounds on values of Rayo's function: Updated page for Rayo's number. (view)

07:32P進大好きbot (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: > when somebody was told their notation was informal they wouldn't respond with "well it's actually ... (view)

03:37Ubersketch (talk  contribs) edited a reply to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: I think the main point of difference is what we consider to be "elementary" or "understandable" here... (view)

03:37Ubersketch (talk  contribs) edited a reply to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: I think the main point of difference is what we consider to be "elementary" or "understandable" here... (view)

03:33Ubersketch (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: I think the main point of difference is what we consider to be "elementary" or "understandable" here... (view)

01:04P進大好きbot (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: I emphasise that giving an introductory explanation is generally good. But your explanation includes... (view)
14 May 2022

22:34P進大好きbot (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: > By confusing I mean a beginner cannot easily understand the behavior from the explanation, despite... (view)

15:58Ubersketch (talk  contribs) edited a reply to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: I think I should clarify. By confusing I mean a beginner cannot easily understand the behavior from ... (view)

15:55Ubersketch (talk  contribs) replied to the comment > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... on the article Ubersketch/Explanation of Buchholz's psi for beginners: I think I should clarify. By confusing I mean a beginner cannot easily understand the behavior from ... (view)

00:12P進大好きbot (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: @Boboris02 > I wrongly assumed that. I remember that you insisted "It is clear" when you stated unpr... (view)
13 May 2022

23:55P進大好きbot (talk  contribs) edited a comment on the article User_blog:Ubersketch/Explanation of Buchholz's psi for beginners: > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... (view)

23:49P進大好きbot (talk  contribs) commented on the article User_blog:Ubersketch/Explanation of Buchholz's psi for beginners: > Ordinal collapsing functions and their associated ordinal notations are important and elementary c... (view)

21:33Binary198 (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: Interesting, I'll have a look. I posted an updated version of CCAs, called LCAs (lightning cardinal ... (view)

21:00Boboris02 (talk  contribs) edited a reply to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: Turns out that \(\beth_{\alpha+1}\) and the continuum don't have to be regular, weirdly enough. I wr... (view)

20:59Boboris02 (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: Turns out that \(\beth_{\alpha+1}\) and the continuum don't have to be regular, weirdly enough. I wr... (view)
12 May 2022

16:01P進大好きbot (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: Thank you. In addition, I know several illdefined versions. Therefore the original claim "BMS is re... (view)

15:24Ubersketch (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: I actually know of at least two different definitions of TBMS, which provide an unambiguous definiti... (view)
10 May 2022

09:11P進大好きbot (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: Oh, it sounds interesting. (view)

08:38Binary198 (talk  contribs) edited a reply to the comment Nice! I'm totally sure that u will manage to analyze KP + Pi_1coll and even beyond. Good luck on the article Binary198/Announcement: Thanks haha, but I kinda doubt I'm that smart. (Btw, KP + Pi_1coll has already been analysed by Ara... (view)

08:03Binary198 (talk  contribs) replied to the comment Seems interesting. If F enumerates eventually computable partial functions (like in Klev’s O++), d... on the article P進大好きbot/A Generic System Analogous to Kleene's O: Fair point. (view)

08:03Binary198 (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: VZ is a sequence system, inspired by Y, I’m making, by the way. (view)

07:46P進大好きbot (talk  contribs) replied to the comment Seems interesting. If F enumerates eventually computable partial functions (like in Klev’s O++), d... on the article P進大好きbot/A Generic System Analogous to Kleene's O: Honestly I have no idea :P (view)

07:34P進大好きbot (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: :) (view)

07:27Binary198 (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: You make a fair point. Then, if it were somehow magically welldefined, this TBMS would be the same ... (view)

07:26Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/A Generic System Analogous to Kleene's O: Seems interesting. If F enumerates eventually computable partial functions (like in Klev’s O++), d... (view)

01:11P進大好きbot (talk  contribs) edited a reply to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: Although Bubby3 insisted "BMS is relatively easy to extend to transfinite entries", it is illdefine... (view)

01:10P進大好きbot (talk  contribs) replied to the comment Apparently your TBMS and VZ matrices are the same. on the article Bubby3/Transfinite BMS extension: Although Bubby3 insisted "BMS is relatively easy to extend to transfinite entries", it is illdefine... (view)
9 May 2022

16:02Binary198 (talk  contribs) commented on the article User_blog:Bubby3/Transfinite BMS extension: Apparently your TBMS and VZ matrices are the same. (view)

03:42P進大好きbot (talk  contribs) replied to the comment \(x_y=x10^y\) already implies that \(0_y=0\) and \(x_0=x\) and also I don't understand what you mean... on the article Mynames3/Strong Subscript Notation: @Mynames3 The shape of the notation looks cool. But as Ubersketch pointed out, the current definitio... (view)

02:43Ubersketch (talk  contribs) edited a comment on the article User_blog:Mynames3/Strong Subscript Notation: \(x_y=x10^y\) already implies that \(0_y=0\) and \(x_0=x\) and also I don't understand what you mean... (view)

02:42Ubersketch (talk  contribs) commented on the article User_blog:Mynames3/Strong Subscript Notation: \(x_y=x10^y\) already implies that \(0_y=0\) and also I don't understand what you mean by \(x/10^n\)... (view)
7 May 2022

14:51Kanrokoti (talk  contribs) replied to the comment In \(\textrm{dom}\), case 3112, don't you mean \(\textrm{dom}(s) := \textrm{dom}(a)\) as opposed ... on the article Kanrokoti/Strong 3var ψ function: Oh nyo. thank you! (view)

07:30Binary198 (talk  contribs) replied to the comment I don't understand the "soundness of ZFC" by itself, would whether ZFC is sound with respect to a de... on the article P進大好きbot/Computable googology in ZFC set theory beyond the transcendental integer system: Okay, thanks. (view)

06:43Binary198 (talk  contribs) commented on the article User_blog:Kanrokoti/Strong 3var ψ function: In \(\textrm{dom}\), case 3112, don't you mean \(\textrm{dom}(s) := \textrm{dom}(a)\) as opposed ... (view)

05:57P進大好きbot (talk  contribs) replied to the comment X^^X is illdefined on the article Hyp cos/Analysis  BEAF, FGH and SGH (part 1): When we refer to the illdefinedness, we usually refer to the illdefinedness with respect to the or... (view)
6 May 2022

21:00Wubbysfriend11 (talk  contribs) replied to the comment X^^X is illdefined on the article Hyp cos/Analysis  BEAF, FGH and SGH (part 1): It is defined. X^^^X is defined too. By us. (view)

12:28P進大好きbot (talk  contribs) replied to the comment I don't understand the "soundness of ZFC" by itself, would whether ZFC is sound with respect to a de... on the article P進大好きbot/Computable googology in ZFC set theory beyond the transcendental integer system: I intended the formulation using the truth in V rather than L. (Since F is the arithmetic Σ_1 in th... (view)

12:08Tsskyx (talk  contribs) edited a comment on the article User_blog:DeepLineMadom/Gamma one: \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... (view)

12:07Tsskyx (talk  contribs) replied to the comment \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... on the article DeepLineMadom/Gamma one: You're correct, \(\varphi_\alpha(\varphi_{\Gamma_0}(0)) = \varphi_{\Gamma_0}(0)\) for the same reaso... (view)

11:56Binary198 (talk  contribs) replied to the comment I don't understand the "soundness of ZFC" by itself, would whether ZFC is sound with respect to a de... on the article P進大好きbot/Computable googology in ZFC set theory beyond the transcendental integer system: According to Rathjen, T is sound if, for every theorem φ of T, L = φ, where L denotes the constru... (view)

08:50P進大好きbot (talk  contribs) commented on the article User_blog:DeepLineMadom/Nerfing block duration of the 3out rule: Revision of the rule for waring is still on the discussion at 2.1 in the policy updating task, and h... (view)

07:48P進大好きbot (talk  contribs) replied to the comment \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... on the article DeepLineMadom/Gamma one: > Hence, the limit \(\alpha \rightarrow \Gamma_0\) of \(\varphi_\alpha(\varphi_{\Gamma_0}(0))\) shou... (view)

07:30Binary198 (talk  contribs) replied to the comment I am afraid that the written definition of g is not what you actually intended, because h_l(n) = h_l... on the article Binary198/A neat little recursion on FGH: Sad. I’ll fix it. (view)

06:26Tsskyx (talk  contribs) edited a comment on the article User_blog:DeepLineMadom/Gamma one: \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... (view)

06:26Tsskyx (talk  contribs) edited a comment on the article User_blog:DeepLineMadom/Gamma one: \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... (view)

06:23Tsskyx (talk  contribs) edited a comment on the article User_blog:DeepLineMadom/Gamma one: \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... (view)

06:20Tsskyx (talk  contribs) commented on the article User_blog:DeepLineMadom/Gamma one: \(\Gamma_0\) is just a symbol, like ☺ or "fbdkjfbakdfaf". It's not a function or anything else. Ho... (view)

01:26P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/A neat little recursion on FGH: I am afraid that the written definition of g is not what you actually intended, because h_l(n) = h_l... (view)
5 May 2022

12:52GamesFan2000 (talk  contribs) commented on the article User_blog:DeepLineMadom/Gamma one: The joys of impredicative transfinite ordinals. (view)

10:36P進大好きbot (talk  contribs) commented on the article User_blog:DeepLineMadom/Gamma one: It is because the limit X of (φ(Γ_0[n],Γ_0+1))_{n∈ω} is a fixed point of the map x→φ(Γ_0(n... (view)
4 May 2022

23:05Idontknow350 (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Thanks (view)

23:00P進大好きbot (talk  contribs) replied to the comment Interesting trial. Although I understand that this is intended to be partially a joke, I give you a ... on the article Icosalord/The Worst OCF ever made?: It is my pleasure, An omega fixed point is an ordinal α such that Ω_α = α. For example, the liim... (view)

19:01Icosalord (talk  contribs) edited a reply to the comment Interesting trial. Although I understand that this is intended to be partially a joke, I give you a ... on the article Icosalord/The Worst OCF ever made?: Thanks! Even if this was a bit of a joke, I did want to at least think of something that could somew... (view)

19:01Icosalord (talk  contribs) replied to the comment Interesting trial. Although I understand that this is intended to be partially a joke, I give you a ... on the article Icosalord/The Worst OCF ever made?: Thanks! Even if this was a bit of a joke, I did want to at least think of something that could somew... (view)

15:02Binary198 (talk  contribs) replied to the comment Do you know what a Mahlo cardinal is? on the article ThaAwesome10/ThaAwesome's Array Notation: I don’t think they do… (view)

15:01Ubersketch (talk  contribs) edited a comment on the article User_blog:ThaAwesome10/ThaAwesome's Array Notation: Do you know what a Mahlo cardinal is? (view)

02:24P進大好きbot (talk  contribs) edited a comment on the article User_blog:Icosalord/The Worst OCF ever made?: Interesting trial. Although I understand that this is intended to be partially a joke, I give you a ... (view)

02:24P進大好きbot (talk  contribs) commented on the article User_blog:Icosalord/The Worst OCF ever made?: Interesting trial. Although I understand that this is intended to be partially a joke, I gave you a... (view)
3 May 2022

13:54Binary198 (talk  contribs) replied to the comment Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... on the article Kanrokoti/Iψ function: Yay! (view)

13:43Kanrokoti (talk  contribs) replied to the comment Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... on the article Kanrokoti/Iψ function: Now it's done!!! (view)

07:13Binary198 (talk  contribs) replied to the comment Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... on the article Kanrokoti/Iψ function: Almost... kek (view)

06:50P進大好きbot (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Actually, fast growing hierarchy is a difficult notion for people who started to learn it first. So,... (view)

01:24Idontknow350 (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Its not bad Its too good i dont even understand it (view)

01:08P進大好きbot (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Uh, I am sorry if my explanation is bad. (view)
2 May 2022

23:58Idontknow350 (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Wtf (view)

23:40P進大好きbot (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Fast growing hierarchy is a family of functions, which people like to use in googology. For example,... (view)

23:20Idontknow350 (talk  contribs) replied to the comment At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... on the article Idontknow350/The jumping ball function: Uhh sorry, but i dont understand what u say Im only a 13 year old kid who tried to make a function (view)

23:18Idontknow350 (talk  contribs) replied to the comment Aren't there 1000 milliseconds in a second though? on the article Idontknow350/The jumping ball function: Haha yes i cant fcking follow normal logic (view)

20:36Kanrokoti (talk  contribs) replied to the comment Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... on the article Kanrokoti/Iψ function: hehe😎😎 (view)

15:18Binary198 (talk  contribs) replied to the comment Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... on the article Kanrokoti/Iψ function: At least it's finally translated. (view)

15:12Kanrokoti (talk  contribs) replied to the comment Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... on the article Kanrokoti/Iψ function: Unfortunately, no. Iψ is more like better version of 3var ψ. And this might have same limit as 3... (view)

10:06Binary198 (talk  contribs) commented on the article User_blog:Kanrokoti/Iψ function: Nice! This is the generalization of \(\theta \psi\), isn't it? Also, sadly a bunch of things aren't ... (view)

08:18Binary198 (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: @Boboris02 The contradiction of powerset doesn't work, since \(\kappa\) has to be a cardinal, not an... (view)

06:16P進大好きbot (talk  contribs) edited a reply to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: Well, I refer to this topic mainly when they make some actions... So the trigger of their annoying b... (view)

06:15P進大好きbot (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: Well, I refer to this topic mainly when they made some actions... So the trigger of their annoying b... (view)

05:4712AbBa (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: Thankfully, it is not usually annoying if you avoid such topics. I have managed to have a peaceful t... (view)

04:03P進大好きbot (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: Thank you for the information. I can imagine how annoying the atomosphere in the server is, and am r... (view)

03:3412AbBa (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: Many people in the server hate you. I do not want to talk extensively with these people about the is... (view)

03:24P進大好きbot (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: > When I say "I wouldn't care", I imagine being the copyright holder of the image. Oh, sorry for mis... (view)

02:5412AbBa (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: When I say "I wouldn't care", I imagine being the copyright holder of the image. Even then I wouldn'... (view)

02:35P進大好きbot (talk  contribs) edited a reply to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: > I don't think most people would care about one of their images being used on this site, unlike cop... (view)

02:32P進大好きbot (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: > I don't think most people would care about one of their images being used on this site, unlike cop... (view)

00:5712AbBa (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: Hmm. I don't think most people would care about one of their images being used on this site, unlike ... (view)
1 May 2022

22:54Ubersketch (talk  contribs) edited a comment on the article User_blog:ThaAwesome10/ThaAwesome's Array Notation: Do you know what a Mahlo cardinal is. (view)

22:52Ubersketch (talk  contribs) commented on the article User_blog:ThaAwesome10/ThaAwesome's Array Notation: How do you know it goes up to Mahlo level? (view)

15:30P進大好きbot (talk  contribs) edited a reply to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: > Why does copyright exist? It exists to allow the creators to earn money without piracy. This is ju... (view)

15:10P進大好きbot (talk  contribs) replied to the comment Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... on the article P進大好きbot/Short summary on the discordrelated incident: > Why does copyright exist? It exists to allow the creators to earn money without piracy. This is ju... (view)

14:43P進大好きbot (talk  contribs) replied to the comment For beginners: if this post is too confusing to you, here is a section in Chapter 2 of my website th... on the article P進大好きbot/A larger orderinal does not necessarily correspond to a greater function through FGH: Oh, I see. (view)

14:43P進大好きbot (talk  contribs) replied to the comment Despite only being closed under the successor operation, do you still conjecture this projection fun... on the article P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: I am not conjecturing the strength of this function. Namely, I will not be surprised if it is weaker... (view)

14:37P進大好きbot (talk  contribs) replied to the comment This is SOO interesting! Good job. I've really grown to like proof theory recently. on the article P進大好きbot/Ordinal Notation with the PTO of ZFC: Thank you! (view)

13:5912AbBa (talk  contribs) commented on the article User_blog:P進大好きbot/Short summary on the discordrelated incident: Indeed, although I am on your side, I cannot understand why so many images on this wiki were removed... (view)

11:3812AbBa (talk  contribs) replied to the comment For beginners: if this post is too confusing to you, here is a section in Chapter 2 of my website th... on the article P進大好きbot/A larger orderinal does not necessarily correspond to a greater function through FGH: That is not a good idea right now. A lot of cleanup needs to be done before all of it is ready to be... (view)

11:06Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: Despite only being closed under the successor operation, do you still conjecture this projection fun... (view)

10:09Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Ordinal Notation with the PTO of ZFC: This is SOO interesting! Good job. I've really grown to like proof theory recently. (view)

07:34P進大好きbot (talk  contribs) replied to the comment For beginners: if this post is too confusing to you, here is a section in Chapter 2 of my website th... on the article P進大好きbot/A larger orderinal does not necessarily correspond to a greater function through FGH: > a section in Chapter 2 of my website I think that it is good for you to share a link to your websi... (view)

05:1712AbBa (talk  contribs) replied to the comment For beginners: if this post is too confusing to you, here is a section in Chapter 2 of my website th... on the article P進大好きbot/A larger orderinal does not necessarily correspond to a greater function through FGH: Oh, and assume n>1. (view)

04:2912AbBa (talk  contribs) commented on the article User_blog:P進大好きbot/A larger orderinal does not necessarily correspond to a greater function through FGH: For beginners: if this post is too confusing to you, here is a section in Chapter 2 of my website th... (view)

02:22Icosalord (talk  contribs) commented on the article User_blog:RightLefts/Terror numbers: 2761448^2 is closer, at only 2428283 off! Your original guess was 1162202419 off, which at that scal... (view)

01:14Ubersketch (talk  contribs) commented on the article User_blog:Idontknow350/The jumping ball function: At best, it has exponential growth, so it is between \(f_3(n)\) and \(f_4(n)\) in fast growing hiera... (view)
30 April 2022

19:23Binary198 (talk  contribs) commented on the article User_blog:C7X/OCFs/Non Hyp cosstyle: Looks super interesting. (view)
29 April 2022

05:10Nuclear43 (talk  contribs) commented on the article User_blog:Idontknow350/The jumping ball function: Aren't there 1000 milliseconds in a second though? (view)
28 April 2022

18:27Binary198 (talk  contribs) edited a comment on the article User_blog:Hyp cos/Attempt of OCF up to Stability: @C7X @Hyp cos In papers such as Stegert's (Ordinal Proof Theory of KripkePlatek set theory Augmente... (view)
27 April 2022

17:38Binary198 (talk  contribs) replied to the comment Nice! I'm totally sure that u will manage to analyze KP + Pi_1coll and even beyond. Good luck on the article Binary198/Announcement: Thanks haha, but I kinda doubt I'm that smart. (Btw, KP + Pi_1coll has already been analysed by Ara... (view)

17:36Tetramur (talk  contribs) commented on the article User_blog:Binary198/Announcement: Nice! I'm totally sure that u will manage to analyze KP + Pi_1coll and even beyond. Good luck (view)

06:01CompactStar (talk  contribs) edited a comment on the article User_blog:Skrato333/What if numbers had loops?: This is a neat idea but there's no need to have a complex nomenclature such as "Big One", "Big Two",... (view)

06:01CompactStar (talk  contribs) edited a comment on the article User_blog:Skrato333/What if numbers had loops?: This is a neat idea but there's no need to have a complex nomenclature such as "Big One", "Big Two",... (view)

05:54CompactStar (talk  contribs) edited a comment on the article User_blog:Skrato333/What if numbers had loops?: This is a neat idea but there's no need to have a complex nomenclature such as "Big One", "Big Two",... (view)

05:54CompactStar (talk  contribs) commented on the article User_blog:Skrato333/What if numbers had loops?: This is a neat idea but there's no need to have a complex nomenclature such as "Big One", "Big Two",... (view)
26 April 2022

17:05Ubersketch (talk  contribs) commented on the article User_blog:Skrato333/What if numbers had loops?: This is either just natural numbers or ordinals. (view)

16:40Binary198 (talk  contribs) commented on the article User_blog:Ubersketch/An LPrSS extension: Nice :) (view)

02:31P進大好きbot (talk  contribs) replied to the comment Good challenge! But unfortunately, this notation is illdefined because many errors. It is better to... on the article Gomen1985/Definition of C sequence: It is my pleasure! If you find something unclear in my comments or something unsolvable in your work... (view)

01:41Gomen1985 (talk  contribs) replied to the comment Good challenge! But unfortunately, this notation is illdefined because many errors. It is better to... on the article Gomen1985/Definition of C sequence: Thanks, I'll check it later. (view)
25 April 2022

22:55P進大好きbot (talk  contribs) edited a reply to the comment Thank you for trying to define an ordinal notation associated to my OCF! Could you explain how you i... on the article Binary198/Ordinal Notation associated to the Successor OCF based on Weakly Compact Cardinals: I see. I hope that you can do it! By the way, when I create an ordinal notation associated to an OCF... (view)

22:54P進大好きbot (talk  contribs) replied to the comment Thank you for trying to define an ordinal notation associated to my OCF! Could you explain how you i... on the article Binary198/Ordinal Notation associated to the Successor OCF based on Weakly Compact Cardinals: I see. I hope that you can do it! By the way, when I create an ordinal notation associated to an OCF... (view)

17:36Binary198 (talk  contribs) replied to the comment Thank you for trying to define an ordinal notation associated to my OCF! Could you explain how you i... on the article Binary198/Ordinal Notation associated to the Successor OCF based on Weakly Compact Cardinals: Maybe I'll have to redo this. (view)

05:20P進大好きbot (talk  contribs) commented on the article User_blog:Gomen1985/Definition of C sequence: Good challenge! But unfortunately, this notation is illdefined because many errors. It is better to... (view)

03:09P進大好きbot (talk  contribs) replied to the comment I'm going to ordinalnotationify this! :~] By the way, how do you represent \(\omega_1\) (the least ... on the article P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: Thank you! I commented to your blog post! (I am sorry if I am making some mistake.) (view)

03:06P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Ordinal Notation associated to the Successor OCF based on Weakly Compact Cardinals: Thank you for trying to define an ordinal notation associated to my OCF! Could you explain how you i... (view)
24 April 2022

23:30Нет конца (talk  contribs) edited a reply to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: "The first point is relevant, at best fictional googology will resemble real googology and have the ... (view)

23:28Нет конца (talk  contribs) edited a reply to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: "The first point is relevant, at best fictional googology will resemble real googology and have the ... (view)

23:18Нет конца (talk  contribs) edited a reply to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: "The first point is relevant, at best fictional googology will resemble real googology and have the ... (view)

23:17Нет конца (talk  contribs) edited a reply to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: "The first point is relevant, at best fictional googology will resemble real googology and have the ... (view)

23:16Нет конца (talk  contribs) edited a reply to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: "The first point is relevant, at best fictional googology will resemble real googology and have the ... (view)

23:07Нет конца (talk  contribs) replied to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: "The first point is relevant, at best fictional googology will resemble real googology and have the ... (view)

17:18EIG520 (talk  contribs) replied to the comment FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... on the article EIG520/Some Powerful Axioms: I updated it to be a lot better. (view)

16:24Binary198 (talk  contribs) replied to the comment I'm going to ordinalnotationify this! :~] By the way, how do you represent \(\omega_1\) (the least ... on the article P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: I published the ON. Tell me if there are any issues, e.g. comparison or standardness. (view)

16:03Ubersketch (talk  contribs) edited a reply to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: The first point is relevant, at best fictional googology will resemble real googology and have the s... (view)

16:03Ubersketch (talk  contribs) replied to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: The first point is relevant, at best fictional googology will resemble real googology and have the s... (view)

14:13P進大好きbot (talk  contribs) replied to the comment I'm going to ordinalnotationify this! :~] By the way, how do you represent \(\omega_1\) (the least ... on the article P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: Oh, great! To be honest, I do not remember its behavour well. Trying to remember what I intended, I ... (view)

13:45Binary198 (talk  contribs) edited a comment on the article User_blog:P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: I'm going to ordinalnotationify this! :~] By the way, how do you represent \(\omega_1\) (the least ... (view)

13:25Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: I'm going to ordinalnotationify this! :~] (view)
23 April 2022

11:45Binary198 (talk  contribs) edited a reply to the comment That was what I was about to write in my book when Pbot stopped me... My book reads "Finall... on the article ReinhardtC/My rant about Aleph(Aleph(0)): Cardinals are not ordinals. They denote completely different classes. EDIT: I'm a complete idiot. Ca... (view)

11:09Binary198 (talk  contribs) commented on the article User_blog:Malachi Wadas/A System of Ordinal Notations over a 3letter alphabet: Hi Theta Meson! (view)
22 April 2022

22:22Нет конца (talk  contribs) replied to the comment Really cool, though in my opinion absolute infinity (if it does exist) is terminus, as I define abso... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: Why do you assume there is anything that is necessarily the largest possible size there is? It could... (view)

22:19Нет конца (talk  contribs) replied to the comment I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... on the article Spelpotatis08/Seeking new members for Fictional Googology Community: As to your first point, that it is pretty silly, we can set that aside. It's neither here nor there,... (view)

15:16Ubersketch (talk  contribs) commented on the article User_blog:Spelpotatis08/Seeking new members for Fictional Googology Community: I actually think fictional googology and hypergoogology is pretty silly, mostly because it either re... (view)

12:47Micro666ham (talk  contribs) commented on the article User_blog:Spelpotatis08/Seeking new members for Fictional Googology Community: Really cool, though in my opinion absolute infinity (if it does exist) is terminus, as I define abso... (view)

09:04P進大好きbot (talk  contribs) replied to the comment Are you trying to submit a paper in the future? It sounds great! Good luck. on the article Tetramur/Big tasks for future: It sounds great, too! (view)

08:12Binary198 (talk  contribs) edited a reply to the comment Are you trying to submit a paper in the future? It sounds great! Good luck. on the article Tetramur/Big tasks for future: That’s awesome! @padic In private, I’ve seen some of the things Tetramur is writing about, and ... (view)

08:09Binary198 (talk  contribs) replied to the comment Are you trying to submit a paper in the future? It sounds great! Good luck. on the article Tetramur/Big tasks for future: That’s cool. @padic I’ve seen some of the things Tetramur is writing about, and they are *very*... (view)

08:01Binary198 (talk  contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: IDK (view)

06:32Tetramur (talk  contribs) edited a reply to the comment Are you trying to submit a paper in the future? It sounds great! Good luck. on the article Tetramur/Big tasks for future: Thanks for your feedback! Yes, I will try to do this: Part 1. Computational complexity in programmin... (view)

06:14Tetramur (talk  contribs) replied to the comment Are you trying to submit a paper in the future? It sounds great! Good luck. on the article Tetramur/Big tasks for future: Thanks for your feedback! Yes, I will try to do this: Part 1. Computational complexity in programmin... (view)

03:15Syke75 (talk  contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: What the fuck (view)
21 April 2022

22:49AntiGerflo (talk  contribs) replied to the comment > We know that... The second and third lines do not make sense, as Sam's number is as illdefined as... on the article GerfloJoroZ/Sam's Number?: This is an empty blog post, xd (view)

22:45P進大好きbot (talk  contribs) commented on the article User_blog:Tetramur/Big tasks for future: Are you trying to submit a paper in the future? It sounds great! Good luck. (view)

17:40Tetramur (talk  contribs) edited a reply to the comment If you could prove that 5^^^5+268, it would be notable, since it would be the largest known prime! on the article Tetramur/Big tasks for future: Actually, 5^^^5+268 is divisible by 3, since 5, 5^5, 5^5^5... all are 2 mod 3, so adding 268 to any ... (view)

17:24Tetramur (talk  contribs) replied to the comment If you could prove that 5^^^5+268, it would be notable, since it would be the largest known prime! on the article Tetramur/Big tasks for future: Actually, 5^^^5+268 is divisible by 3, since 5, 5^5, 5^5^5... all are 2 mod 3, so adding 268 to any ... (view)

17:16Ubersketch (talk  contribs) commented on the article User_blog:Tetramur/Big tasks for future: If you could prove that 5^^^5+268, it would be notable, since it would be the largest known prime! (view)

09:30P進大好きbot (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: :) (view)

08:42Binary198 (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: Sorry, typo. (view)

08:42Binary198 (talk  contribs) edited a reply to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: On an unrelated note, I memorised 31 digits of ζ(3). 1.202056903159594285399738161511 (view)

08:41P進大好きbot (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: Wikipedia insists that it is 1.202056903159594285399738161511. (view)

08:33Binary198 (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: On an unrelated note, I memorised 31 digits of ζ(3). 1.202056903159594285399738161512 (view)

07:45P進大好きbot (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: Thank you. I wondered who is using the convention, because I am curious about the use of terminology... (view)

02:16Ubersketch (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: AFAIK since weakly wMahlo has conflicting definitions in multiple sources, some people use pseudow... (view)
20 April 2022

22:36P進大好きbot (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: > but I have seen some authors refer to my notion of "ωMahlos" as ωMahlo instead of ω+1Mahlo I... (view)

18:39Binary198 (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: I managed to finish the definition of the OCF. I will probably publish it (maybe also an associated ... (view)

15:27Binary198 (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: I've never seen anyone call these "weakly pseudoω Mahlo cardinals", but I have seen some authors r... (view)

15:16Kanrokoti (talk  contribs) edited a reply to the comment Huh, nice! Is this what you were referring to on the Googology Discord? on the article Kanrokoti/Easy definition of Buchholz's psi: Yes. That's hence I didn't said that this is an ordinal notation. I omitted the order < for simplici... (view)

15:03P進大好きbot (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: Thank you. I prefer to call "weakly pseudoω Mahlo cardinals" in your sense "weakly ωMahlo cardin... (view)

15:03Kanrokoti (talk  contribs) edited a reply to the comment Huh, nice! Is this what you were referring to on the Googology Discord? on the article Kanrokoti/Easy definition of Buchholz's psi: Yes. That's hence I didn't said that this is an ordinal notation. I omitted the order < for simplici... (view)

14:53Kanrokoti (talk  contribs) replied to the comment Huh, nice! Is this what you were referring to on the Googology Discord? on the article Kanrokoti/Easy definition of Buchholz's psi: Yes. That's hence I didn't said that this is an ordinal notation. Moreover, we need to redefine the... (view)

14:49Binary198 (talk  contribs) replied to the comment I would bet that the \(n+2\)th layer correspond to \(n\)shrewdness, but I am also unsure. But provi... on the article P進大好きbot/Sketch of layers in 四関数: Funnily enough, I had my Chinese class right after I wrote this comment. (view)

14:49Binary198 (talk  contribs) edited a reply to the comment Huh, nice! Is this what you were referring to on the Googology Discord? on the article Kanrokoti/Easy definition of Buchholz's psi: Nice. I like ordinal notations and OCFs, they're very fun 🐻 Although, sadly, this is not an ordin... (view)

14:47Binary198 (talk  contribs) replied to the comment Huh, nice! Is this what you were referring to on the Googology Discord? on the article Kanrokoti/Easy definition of Buchholz's psi: Nice. I like ordinal notations and OCFs, they're very fun 🐻 (view)

14:46Binary198 (talk  contribs) replied to the comment Could you explain what is the definition of "weakly ωMahlo" in your terminology? on the article Binary198/I need advice: Weakly \(\alpha\)Mahlo = Regular and the ordinals which are weakly \(\beta\)Mahlo for all \(\beta ... (view)

14:34Kanrokoti (talk  contribs) replied to the comment Huh, nice! Is this what you were referring to on the Googology Discord? on the article Kanrokoti/Easy definition of Buchholz's psi: Thank you 🐻🐻. And yes! As you can see, I omitted the order < and replace dom with cut part sea... (view)

12:13P進大好きbot (talk  contribs) replied to the comment I would bet that the \(n+2\)th layer correspond to \(n\)shrewdness, but I am also unsure. But provi... on the article P進大好きbot/Sketch of layers in 四関数: Too cruel for the reader :D (view)

12:08P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/I need advice: Could you explain what is the definition of "weakly ωMahlo" in your terminology? (view)

11:31Binary198 (talk  contribs) replied to the comment I would bet that the \(n+2\)th layer correspond to \(n\)shrewdness, but I am also unsure. But provi... on the article P進大好きbot/Sketch of layers in 四関数: That last part is a joke btw. (view)

11:31Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Sketch of layers in 四関数: I would bet that the \(n+2\)th layer correspond to \(n\)shrewdness, but I am also unsure. But provi... (view)

11:27Binary198 (talk  contribs) commented on the article User_blog:Kanrokoti/Easy definition of Buchholz's psi: Huh, nice! Is this what you were referring to on the Googology Discord? (view)
19 April 2022

13:08Binary198 (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: Interesting. I guess this was an interesting trial though! (view)
18 April 2022

21:29Boboris02 (talk  contribs) edited a reply to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: "for limit ordinals κ, CCA is impossible as the former has cofinality κ and the latter has cofinal... (view)

21:26Boboris02 (talk  contribs) edited a reply to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: "for limit ordinals κ, CCA is impossible as the former has cofinality κ and the latter has cofinal... (view)

21:07Boboris02 (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: "for limit ordinals κ, CCA is impossible as the former has cofinality κ and the latter has cofinal... (view)
17 April 2022

07:02Binary198 (talk  contribs) replied to the comment \(L\) contains all strictly increasing functions on some fragment of the natural numbers. \(F^L\), i... on the article Binary198/One of the new biggest numbers?: I guessed that this was illdefined. But hey, good try! (view)
15 April 2022

19:43Binary198 (talk  contribs) replied to the comment GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... on the article Binary198/Continuum cardinal axiom: I didn't realise this. (view)

15:10P進大好きbot (talk  contribs) replied to the comment I believe level 24 is too low as an upper bound for Tarintar and 18 is ridiculously low. Taranovsky ... on the article P進大好きbot/New Googological Ruler: > Thus under your regulation for the computable section, TON should be allowed You are completely wr... (view)

14:49P進大好きbot (talk  contribs) replied to the comment There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... on the article P進大好きbot/New Googological Ruler: > I read through your entire blog before I made my comment. All the questions that I had, I still ha... (view)

14:26P進大好きbot (talk  contribs) replied to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: I am not insisting the circularity of the final rule. The circularity is related to the definition o... (view)

11:46Boboris02 (talk  contribs) replied to the comment I believe level 24 is too low as an upper bound for Tarintar and 18 is ridiculously low. Taranovsky ... on the article P進大好きbot/New Googological Ruler: Definability and provability are not the same thing. Everything "definable" in ZFC is simply definab... (view)

11:18Boboris02 (talk  contribs) edited a reply to the comment There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... on the article P進大好きbot/New Googological Ruler: I read through your entire blog before I made my comment. All the questions that I had, I still have... (view)

11:17Boboris02 (talk  contribs) edited a reply to the comment There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... on the article P進大好きbot/New Googological Ruler: I read through your entire blog before I made my comment. All the questions that I had, I still have... (view)

11:17Boboris02 (talk  contribs) replied to the comment There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... on the article P進大好きbot/New Googological Ruler: I read through your entire blog before I made my comment. All the questions that I had, I still have... (view)

10:52Boboris02 (talk  contribs) commented on the article User_blog:Binary198/Continuum cardinal axiom: GCCA can't happen. A simple contradiction is \(\beth_\omega=\aleph_{\omega_1}\). This is not possibl... (view)

10:50Tsskyx (talk  contribs) replied to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: The final rule says that such an expression with a limit case in the subscript (as given by rule 3) ... (view)

10:32Boboris02 (talk  contribs) commented on the article User_blog:Binary198/One of the new biggest numbers?: \(L\) contains all strictly increasing functions on some fragment of the natural numbers. \(F^L\), i... (view)

06:07Binary198 (talk  contribs) replied to the comment Definition of BIG FOFT? I can’t find it. on the article Koteitan/Googol Map Phylogenetics of Googology: Thanks. (view)

04:17P進大好きbot (talk  contribs) edited a reply to the comment There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... on the article P進大好きbot/New Googological Ruler: > 1) You know perfectly well that f_{PTO(ZFC)}(n) is not welldefined. I am afraid that you commente... (view)

03:27P進大好きbot (talk  contribs) replied to the comment There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... on the article P進大好きbot/New Googological Ruler: > 1) You know perfectly well that f_{PTO(ZFC)}(n) is not welldefined. I am afraid that you commente... (view)

03:21P進大好きbot (talk  contribs) replied to the comment I believe level 24 is too low as an upper bound for Tarintar and 18 is ridiculously low. Taranovsky ... on the article P進大好きbot/New Googological Ruler: > I believe level 24 is too low as an upper bound for Tarintar I am afraid that you have not read th... (view)

02:07Boboris02 (talk  contribs) replied to the comment Definition of BIG FOFT? I can’t find it. on the article Koteitan/Googol Map Phylogenetics of Googology: Here Although it is illdefined for the same reasons FOOT is illdefined and then some. (view)

00:49Boboris02 (talk  contribs) edited a comment on the article User_blog:P進大好きbot/New Googological Ruler: I believe level 24 is too low as an upper bound for Tarintar and 18 is ridiculously low. Taranovsky ... (view)

00:49Boboris02 (talk  contribs) edited a comment on the article User_blog:P進大好きbot/New Googological Ruler: I believe level 24 is too low as an upper bound for Tarintar and 18 is ridiculously low. Taranovsky ... (view)

00:48Boboris02 (talk  contribs) commented on the article User_blog:P進大好きbot/New Googological Ruler: I believe level 24 is too low as an upper bound for Tarintar and 18 is ridiculously low. Taranovsky ... (view)
14 April 2022

23:38Boboris02 (talk  contribs) edited a comment on the article User_blog:P進大好きbot/New Googological Ruler: There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... (view)

23:38Boboris02 (talk  contribs) commented on the article User_blog:P進大好きbot/New Googological Ruler: There are a lot of strange choices in this blog post that I don't understand: 1) You know perfectly ... (view)

23:20P進大好きbot (talk  contribs) edited a reply to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: I think that the following guideline helps you to formalise your idea: User blog:P進大好きbot/Ho... (view)

23:17P進大好きbot (talk  contribs) replied to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: I think that the following guideline helps you to formalise your idea: User blog:P進大好きbot/Ho... (view)

23:13P進大好きbot (talk  contribs) edited a reply to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: Thank you for the detailed explanation. But I think that your definition has problems. First, althou... (view)

22:54P進大好きbot (talk  contribs) replied to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: Thank you for the detailed explanation. But I think that your definition has problems. First, althou... (view)

19:32Tsskyx (talk  contribs) replied to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: It's not an OCF per se, but it can be extended to incorporate ordinal collapsing. For now, it's just... (view)

15:12RightLefts (talk  contribs) edited a comment on the article User_blog:DeepLineMadom/Historical background of the illdefinedness of HyperB notation: If you go to https://googology.fandom.com/wiki/User_blog:BlankEntity/HyperB_notation?action=history... (view)

15:10RightLefts (talk  contribs) commented on the article User_blog:DeepLineMadom/Historical background of the illdefinedness of HyperB notation: There are some VERY old versions of HyperB Notation here if you check the history on it (view)

11:18P進大好きbot (talk  contribs) replied to the comment I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... on the article P進大好きbot/Sketch of layers in 四関数: It sounds strange. I know three explicit examples of OCFs without addition, but none of them satisfi... (view)

10:10Tsskyx (talk  contribs) commented on the article User_blog:P進大好きbot/Sketch of layers in 四関数: I'm practically lost here, but I wanna mention a discovery I've made a while back. A 2ary OCF can i... (view)
13 April 2022

17:57Binary198 (talk  contribs) commented on the article User_blog:Ubersketch/Short post: Why not collapse worldly cardinals?: I have something to say: collapsing the least worldly cardinal is silly, but I would say it for a di... (view)

14:06Binary198 (talk  contribs) replied to the comment Good trial, but unfortunately it is incorrect, because "Taking the powerset of boh sides" is not com... on the article Binary198/Is this proof correct?: Oh, okay. Thanks for letting me know. (view)

12:25P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Is this proof correct?: Good trial, but unfortunately it is incorrect, because "Taking the powerset of boh sides" is not com... (view)

10:28P進大好きbot (talk  contribs) replied to the comment What is the definition of p? SInce you are claiming p1(p3)=p1(p2(p3(p4(...)))), it does not seem to ... on the article Gomen1985/A way turn hydra to worm: What hydra are you considering, and what is the precise definition of your extension? (view)

08:59Gomen1985 (talk  contribs) replied to the comment What is the definition of p? SInce you are claiming p1(p3)=p1(p2(p3(p4(...)))), it does not seem to ... on the article Gomen1985/A way turn hydra to worm: It's an extension of hydra. (view)

08:19P進大好きbot (talk  contribs) commented on the article User_blog:Gomen1985/A way turn hydra to worm: What is the definition of p? SInce you are claiming p1(p3)=p1(p2(p3(p4(...)))), it does not seem to ... (view)

00:37EIG520 (talk  contribs) commented on the article User_blog:HaydenTheGoogologist2009/Hayden's Array Notation: Maybe try to define the expansion rules instead of mapping it to BEAF so that it's more original? (view)
12 April 2022

13:35HaydenTheGoogologist2009 (talk  contribs) replied to the comment Have you defined the rest of this on an external source such as a website? Because if the definition... on the article HaydenTheGoogologist2009/Hayden's Array Notation: You can see the rest of the definition in the definition section (all of the definitions are using t... (view)

12:02KaffeeByte (talk  contribs) commented on the article User_blog:HaydenTheGoogologist2009/Hayden's Array Notation: Have you defined the rest of this on an external source such as a website? Because if the definition... (view)

08:09ARsygo (talk  contribs) edited a comment on the article User_blog:DeepLineMadom/Tethrarxisifa'zoza'bront: Can we have "sifa'zoza'bronticahlah", "tethrasifa'zoza'bronton", etc.? (view)

08:09ARsygo (talk  contribs) commented on the article User_blog:DeepLineMadom/Tethrarxisifa'zoza'bront: Can we have "sifa'zoza'brontahlah", "tethrasifa'zoza'bronton", etc.? (view)
11 April 2022

23:45EIG520 (talk  contribs) replied to the comment FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... on the article EIG520/Some Powerful Axioms: I made the condition a bit better, which solves the case you stated here, but even though I can't th... (view)

15:34Ubersketch (talk  contribs) edited a reply to the comment FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... on the article EIG520/Some Powerful Axioms: What do you mean by "only contain (unique) limit ordinals which follow this rule"? I think you want ... (view)

15:32Ubersketch (talk  contribs) replied to the comment FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... on the article EIG520/Some Powerful Axioms: What do you mean by "only contain (unique) limit ordinals which follow this rule"? I think you want ... (view)
10 April 2022

21:35ARsygo (talk  contribs) commented on the article User_blog:TheAzureGoogologist/Tomatillion: Well, I (or other admins) can delete the blog post actually. (view)

21:02TheAzureGoogologist (talk  contribs) commented on the article User_blog:Forthright/Poopitypoopscoopillion: Grand poopitypoopscoopillion = f^f(10^100013)(f(10^100013)) (view)

16:14EIG520 (talk  contribs) replied to the comment FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... on the article EIG520/Some Powerful Axioms: Ok I think I fixed it. (view)

04:27EIG520 (talk  contribs) replied to the comment FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... on the article EIG520/Some Powerful Axioms: I thought that wasn't an issue since you can't subtract from limit ordinals, and most of the least f... (view)

01:33Ubersketch (talk  contribs) edited a comment on the article User_blog:EIG520/Some Powerful Axioms: FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... (view)

01:19Ubersketch (talk  contribs) commented on the article User_blog:EIG520/Some Powerful Axioms: FGH requires a system of fundamental sequences. If you allow for arbitrary fundamental sequences, GR... (view)
9 April 2022

01:10Usernamewastaken249timez2 (talk  contribs) replied to the comment So, is it actually 2^n+1? on the article Usernamewastaken249timez2/bleep sequence: Yes (view)

00:47EIG520 (talk  contribs) edited a reply to the comment So, is it actually 2^n+1? on the article Usernamewastaken249timez2/bleep sequence: So a modification of Mersenne numbers? (view)

00:47EIG520 (talk  contribs) replied to the comment So, is it actually 2^n+1? on the article Usernamewastaken249timez2/bleep sequence: So a slight modification of Mersenne numbers? (view)

00:46Usernamewastaken249timez2 (talk  contribs) commented on the article User_blog:Usernamewastaken249timez2/blorp sequence: I guess you could say it started with 2.5 (view)

00:42Usernamewastaken249timez2 (talk  contribs) replied to the comment So, is it actually 2^n+1? on the article Usernamewastaken249timez2/bleep sequence: I guess so (view)

00:20ARsygo (talk  contribs) commented on the article User_blog:Usernamewastaken249timez2/bleep sequence: So, is it actually 2^n+1? (view)
8 April 2022

23:18AntiGerflo (talk  contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: I am chadder than you (view)

08:03Binary198 (talk  contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: LOL (view)

00:32AntiGerflo (talk  contribs) replied to the comment Ahhh, salad numbers. on the article GerfloJoroZ/Making Salad: Salad (view)

00:31AntiGerflo (talk  contribs) edited a reply to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: I will Bionico Blunkett salad Broccoli slaw Buljol Candle salad Carrot salad Chicken Nugget Salad De... (view)

00:31AntiGerflo (talk  contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: I will Bionico Blunkett salad Broccoli slaw Buljol Candle salad Carrot salad Chicken Nugget Salad De... (view)
7 April 2022

01:17P進大好きbot (talk  contribs) replied to the comment Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... on the article Binary198/Cardinal characteristics of the continuum: I noticed that even articles in wikipedia are incorrect... Perhaps it is a sort of common mistakes s... (view)

00:24Grubb257 (talk  contribs) replied to the comment Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... on the article Binary198/Cardinal characteristics of the continuum: You are correct. (view)
6 April 2022

14:21P進大好きbot (talk  contribs) replied to the comment Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... on the article Binary198/Cardinal characteristics of the continuum: @Grubb257 > such that any pair is almost disjoint Although this is a minor issue, it should be a typ... (view)

12:57Grubb257 (talk  contribs) replied to the comment Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... on the article Binary198/Cardinal characteristics of the continuum: There are actually several more 'cardinal characteristics'. Several are described in Kunen's book on... (view)

09:49Binary198 (talk  contribs) commented on the article User_blog:Scorcher007/Biggest ordinal's table: The webpage is down, so I can't view it. (view)
5 April 2022

08:25Binary198 (talk  contribs) replied to the comment Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... on the article Binary198/Cardinal characteristics of the continuum: I had a look at Cichoń's diagram while researching this blog post. (view)
4 April 2022

20:24Wubbysfriend11 (talk  contribs) replied to the comment This is not the end of BEAF. We can have /type squarebracketed legions (e.g {[L,X/2]}b,p), and... on the article Hyp cos/Analysis  BEAF, FGH and SGH (part 3): Cookie, so, I found this on the page for BEAF. "The Googology Wiki users Deedlit11 and Ikosarakt1 ha... (view)

19:23Grubb257 (talk  contribs) commented on the article User_blog:GamesFan2000/Bethone could be alephone, or it could be a rankintorank cardinal: Actually, \( \beth_1 \) cannot be equal to the *first* aleph fixed point since that cardinal has cof... (view)

19:16Grubb257 (talk  contribs) edited a comment on the article User_blog:Binary198/Cardinal characteristics of the continuum: Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... (view)

19:15Grubb257 (talk  contribs) commented on the article User_blog:Binary198/Cardinal characteristics of the continuum: Quite a lot is known about these cardinals. You might want to refer to Cichon's diagram, which gives... (view)
2 April 2022

05:45Nayuta Ito (talk  contribs) commented on the article User_blog:Ubersketch/Analysis of BM5: Isn't (0,0)(1,1)=e0 too in BM5? (view)
1 April 2022

23:31P進大好きbot (talk  contribs) replied to the comment > As I recently got infected Oh, I hope you to get well soon... on the article Ynought/Revolutionising Googology: It is good to hear that! (view)

17:02Ytosk (talk  contribs) commented on the article User_blog:Ubersketch/Analysis of BM5: I think it's possible to modify the rules of Y to match this behavior and have similar upgrading rel... (view)

16:25Spelpotatis (talk  contribs) commented on the article User_blog:Ubersketch/Analysis of BM5: Bru you didn't even reach fictional googlogy numbers yet Reach this Terminus  Fictional Googology W... (view)

16:23Binary198 (talk  contribs) replied to the comment Wow! Next year, I'll have to take it one step further. on the article Ynought/Revolutionising Googology: However, after 10 years of researching classified files, I have found the unutterable cardinals. The... (view)

16:03Ynought (talk  contribs) commented on the article User_blog:Ubersketch/Analysis of BM5: WOW! I never thought BM5 was THAT powerful! (view)

16:02Ynought (talk  contribs) replied to the comment Wow! Next year, I'll have to take it one step further. on the article Ynought/Revolutionising Googology: That will be hard because you will need a number bigger than terminus, which is basically impossible... (view)

16:01Ynought (talk  contribs) replied to the comment > As I recently got infected Oh, I hope you to get well soon... on the article Ynought/Revolutionising Googology: I wrote this post like half a week ago and I am already negative again. But thanks anyway! (view)

14:40P進大好きbot (talk  contribs) commented on the article User_blog:Ynought/Revolutionising Googology: > As I recently got infected Oh, I hope you to get well soon... (view)

14:25Binary198 (talk  contribs) commented on the article User_blog:Ynought/Revolutionising Googology: Wow! Next year, I'll have to take it one step further. (view)

10:54P進大好きbot (talk  contribs) replied to the comment I think that this is an April fool joke, because the direct use of the class A is not allowed, becau... on the article Binary198/An extremely powerful kind of large cardinal: I see (:3) (view)

10:47Binary198 (talk  contribs) replied to the comment I think that this is an April fool joke, because the direct use of the class A is not allowed, becau... on the article Binary198/An extremely powerful kind of large cardinal: It was an April fools joke indeed :) For unordered sum, I don't intend a specific order. (view)

10:31P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/An extremely powerful kind of large cardinal: I think that this is an April fool joke, because the direct use of the class A is not allowed, becau... (view)

10:23P進大好きbot (talk  contribs) replied to the comment \(\mathbb{Q}_p\) is the set of \(p\)adic numbers. "P進大好きbot" translates to roughly "padic ... on the article P進大好きbot/Introduction to Programming Language Qp: I noticed it now, and I will check it soon :) (view)

09:11Binary198 (talk  contribs) replied to the comment \(\mathbb{Q}_p\) is the set of \(p\)adic numbers. "P進大好きbot" translates to roughly "padic ... on the article P進大好きbot/Introduction to Programming Language Qp: Oh, I didn't realize that! Maybe it is a coincidence after all (or maybe you're joking, after all, i... (view)

08:44P進大好きbot (talk  contribs) replied to the comment \(\mathbb{Q}_p\) is the set of \(p\)adic numbers. "P進大好きbot" translates to roughly "padic ... on the article P進大好きbot/Introduction to Programming Language Qp: Haha, it sounds interesting! p進 is a very common given name in Japan, and 大好きbot is a very c... (view)

08:33Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Introduction to Programming Language Qp: \(\mathbb{Q}_p\) is the set of \(p\)adic numbers. "P進大好きbot" translates to roughly "padic ... (view)

08:29Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Which one is stronger: BEAF or UNOCF?: Haha, this was a good April fools joke! :) (view)

06:25P進大好きbot (talk  contribs) commented on the article User_blog:GamesFan2000/Algebra on Differences of Square Numbers: I note that the equation holds even for complex numbers, One of the main application of the equality... (view)

03:21Kyodaisuu (talk  contribs) replied to the comment Why should we have so many redirects like these? on the article DeepLineMadom/Sam's Number redirects: I wonder what @DeepLineMadom thinks. (view)

03:19P進大好きbot (talk  contribs) replied to the comment You need to write a book about it. and not even one. but in general, a great joke)))) on the article P進大好きbot/Which one is stronger: BEAF or UNOCF?: Thank you! (view)

01:46Konkhra (talk  contribs) commented on the article User_blog:P進大好きbot/Which one is stronger: BEAF or UNOCF?: You need to write a book about it. and not even one. but in general, a great joke)))) (view)

01:32P進大好きbot (talk  contribs) replied to the comment Where is the precise definition of "ψ" in your analysis? I am afraid that ψ is illdefined, becaus... on the article Boboris02/Analysis of Taranovsky's Ordinal Notation with "standard OCFs.": Thank you. But I am certain that it is not precisely what the author of this blog post intended, bec... (view)

01:2412AbBa (talk  contribs) replied to the comment Where is the precise definition of "ψ" in your analysis? I am afraid that ψ is illdefined, becaus... on the article Boboris02/Analysis of Taranovsky's Ordinal Notation with "standard OCFs.": It is likely an OCF that behaves like my OCF. https://googology.fandom.com/wiki/User:12AbBa/%22Norma... (view)
31 March 2022

14:27P進大好きbot (talk  contribs) replied to the comment Why should we have so many redirects like these? on the article DeepLineMadom/Sam's Number redirects: In that case, it can be a notability issue. Since the alternative spells with different capitalisati... (view)

14:08Kyodaisuu (talk  contribs) replied to the comment Why should we have so many redirects like these? on the article DeepLineMadom/Sam's Number redirects: If that is the only reason, I don't think we need so many redirects. (view)

12:15P進大好きbot (talk  contribs) replied to the comment Why should we have so many redirects like these? on the article DeepLineMadom/Sam's Number redirects: It seems because the user himself or herself coined those alternative names in his or her web site. (view)

11:26Kyodaisuu (talk  contribs) commented on the article User_blog:DeepLineMadom/Sam's Number redirects: Why should we have so many redirects like these? (view)
30 March 2022

23:11P進大好きbot (talk  contribs) commented on the article User_blog:Boboris02/Analysis of Taranovsky's Ordinal Notation with "standard OCFs.": Where is the precise definition of "ψ" in your analysis? I am afraid that ψ is illdefined, becaus... (view)
29 March 2022

16:33Kanrokoti (talk  contribs) commented on the article User_blog:Ubersketch/Sequence systemlike notation for Buchholz psi: Looks interesting (view)

06:48Binary198 (talk  contribs) edited a reply to the comment It is wrong, if I correctly remember. The cardinality of *R is the same as that of R, as R^N itself ... on the article Binary198/Another question: Oh, ok. Thanks (view)

06:48Binary198 (talk  contribs) replied to the comment It is wrong, if I correctly remember. The cardinality of *R is the same as that of R, as R^N itself ... on the article Binary198/Another question: Oh, ok. (view)

00:53P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Another question: It is wrong, if I correctly remember. The cardinality of *R is the same as that of R, as R^N itself ... (view)
28 March 2022

18:45Ubersketch (talk  contribs) edited a comment on the article User_blog:Binary198/Ubersketch's idea: You're allowed to intersect as many times as you'd like but only apply Y_g less than x times where x... (view)

18:22Ubersketch (talk  contribs) edited a comment on the article User_blog:Binary198/Ubersketch's idea: You're allowed to intersect as many times as you'd like but only apply Y_g less than x times where x... (view)

18:16Ubersketch (talk  contribs) edited a comment on the article User_blog:Binary198/Ubersketch's idea: You're allowed to intersect as many times as you'd like but only apply Y_(a1) less than x times whe... (view)

18:12Ubersketch (talk  contribs) edited a comment on the article User_blog:Binary198/Ubersketch's idea: You're allowed to intersect as many times as you'd like but only apply Y_(a1) less than x times whe... (view)

18:10Ubersketch (talk  contribs) edited a comment on the article User_blog:Binary198/Ubersketch's idea: You're allowed to intersect as many times as you'd like but only apply Y_g less than x times where x... (view)

18:08Ubersketch (talk  contribs) commented on the article User_blog:Binary198/Ubersketch's idea: You're allowed to intersect as many times as you'd like but only apply Y_g less than x times where x... (view)

14:13Binary198 (talk  contribs) edited a reply to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Ah, interesting! A functional approach, I see. I’m more acquainted with objectoriented and multi... (view)

07:20P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Since Qp does not allow a change of the value of a variable (in order to be more compatible with the... (view)

07:12Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Ah, interesting! A functional approach, I see. I’m more acquainted with objectoriented approaches... (view)

01:53P進大好きbot (talk  contribs) edited a reply to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: You can check it by checking DENESTABLE( x ) is false and DENESTABLE( ENTRY( n , x ) ) is true for a... (view)

01:52P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: You can check it by checking DENESTABLE( x ) is false and DENESTABLE( ENTRY( n , x ) ) is true for a... (view)
27 March 2022

14:11Binary198 (talk  contribs) replied to the comment That didn't take you long, did it? on the article Binary198/Ubersketch's idea: Nope haha (view)

13:09GamesFan2000 (talk  contribs) commented on the article User_blog:Binary198/Ubersketch's idea: That didn't take you long, did it? (view)

11:19Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: One last thing: So I see that you can you DENESTABLE(x) to tell whether x is not an array of nested ... (view)

10:44P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Oh, I see. (view)

10:41P進大好きbot (talk  contribs) replied to the comment The exact value depends on the choice of enumeration of Turing machines, which we need to fix to de... on the article GamesFan2000/Question regarding the ChurchKleene ordinal: It is my pleasure. (view)

10:13Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: I realised I won't be able to implement the expansion algorithm since the computational complexity w... (view)

09:29Binary198 (talk  contribs) commented on the article User_blog:Ubersketch/Idea: Interesting... (view)

09:26Binary198 (talk  contribs) replied to the comment The exact value depends on the choice of enumeration of Turing machines, which we need to fix to de... on the article GamesFan2000/Question regarding the ChurchKleene ordinal: Yes, you are correct. Thanks for explaining it so well to GamesFan2000. (view)

09:24Binary198 (talk  contribs) replied to the comment What exactly does being of a higher level mean in terms of making the function stronger? What exactl... on the article Binary198/Apotheosis ordinal notation: > What exactly does being of a higher level mean in terms of making the function stronger? Terms suc... (view)

05:03P進大好きbot (talk  contribs) commented on the article User_blog:GamesFan2000/Question regarding the ChurchKleene ordinal: The exact value depends on the choice of enumeration of Turing machines, which we need to fix to de... (view)

00:21FundamentalSeq (talk  contribs) replied to the comment What exactly does being of a higher level mean in terms of making the function stronger? What exactl... on the article Binary198/Apotheosis ordinal notation: In particular, is the concept of 'level' strengthening limit cardinals related in any way to Stellar... (view)

00:19FundamentalSeq (talk  contribs) commented on the article User_blog:GamesFan2000/Superpower Sets...?: The second half of the calculation involves taking all the subsets of a set and adding them together... (view)
26 March 2022

12:25P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Wow, it sounds great! (view)

11:37GamesFan2000 (talk  contribs) commented on the article User_blog:Binary198/Apotheosis ordinal notation: What exactly does being of a higher level mean in terms of making the function stronger? What exactl... (view)

10:49Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Ah, thanks. I am currently attempting to implement my shrewdness ordinal notation in Qp, so look out... (view)

10:22P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Precisely speaking, x is always of type T rather than of type int, but I understand what you mean. (... (view)

09:32Binary198 (talk  contribs) edited a reply to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: @P進大好きbot I have another question. If you do the following: NEST(T,int) USE(T,x) Is there so... (view)

09:27Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: @P進大好きbot I have another question. If you do the following: NEST(T,int) USE(T,x) Is there so... (view)

07:12Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: :) (view)
25 March 2022

23:32P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Thank you! (view)

19:39Tsskyx (talk  contribs) commented on the article User_blog:Binary198/Apotheosis ordinal notation: The only thing I can say to this is that Buchholz's OCF uses a less efficient collapsing algorithm t... (view)

16:27Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Ah, I see. I read some of the Qp documentation on your website by the way. (view)

14:24P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Given a type S, NEST(T,S) means "Define T as the type of nested arrays of S". The notion of a nested... (view)

13:32Binary198 (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: By the way, what does the command “NEST” do? (view)

12:50P進大好きbot (talk  contribs) replied to the comment Good job. I feel like I will install and use this, on the article P進大好きbot/Introduction to Programming Language Qp: Thank you :) (view)

09:16Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Introduction to Programming Language Qp: Good job. I feel like I will install and use this, (view)

08:37Binary198 (talk  contribs) replied to the comment I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... on the article CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: Yes. (view)

05:31GamesFan2000 (talk  contribs) replied to the comment I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... on the article CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: Wow. That's actually very interesting. And then, the 1MFP to the first 2Mahlo would also be a comp... (view)
24 March 2022

19:20EIG520 (talk  contribs) commented on the article User_blog:CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: This is probably a stupid and overly ambitious idea but here me out: 2Mahlos,3Mahlos,nMahlos We f... (view)

16:17Ubersketch (talk  contribs) commented on the article User_blog:CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: How does this compete with Pi_nreflecting OCFs if 1Mahlo has an analogue within Pi_nreflecting or... (view)

14:28Binary198 (talk  contribs) edited a reply to the comment I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... on the article CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: 1Mahlo vs MFP is like Mahlo vs OFP, (view)

13:59Binary198 (talk  contribs) replied to the comment I think they're making it too obvious. Check their comments activity for proof it's most likely them... on the article Spelpotatis08/All GWiki users, i would like to hear what you know about a thing.: I saw your blog post about operation stage Mahlo, and commented on it. (view)

13:58Binary198 (talk  contribs) replied to the comment I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... on the article CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: 1Mahlo vs Mahlo fixed points is like Mahlo vs Omega fixed points, (view)

13:45GamesFan2000 (talk  contribs) replied to the comment I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... on the article CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: I've always wondered how the first 1Mahlo compares to the Mahlo fixed points (view)

12:26Binary198 (talk  contribs) edited a comment on the article User_blog:CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... (view)

12:26Binary198 (talk  contribs) commented on the article User_blog:CaptainChurchill/OPERATION STAGE MAHLO CARDINAL: I think the idea “1Mahlos have so much hidden structure which has not been previously exploited b... (view)

01:12P進大好きbot (talk  contribs) replied to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: > the group of units, \( U(Z_n^* ) \). I guess that U(Z_n^* ) is a typo of U(Z_n) or Z_n^*, although... (view)

01:01Polymath257 (talk  contribs) replied to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: True. They follow from the characterization of the group of units, \( U(Z_n^* ) \). Those powers of ... (view)
23 March 2022

23:10P進大好きbot (talk  contribs) replied to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: > A basic result is Fermat's little theorem: What you wrote is not Fermat's little theorem, but is E... (view)

23:04P進大好きbot (talk  contribs) replied to the comment > You can find the last digit of a very large powertower by finding cycles in the final digits of sm... on the article EIG520/Cool Modulus Thing: > Something along this line is correct, though. What do you mean? The article which I cited clearly ... (view)

22:15CaptainChurchill (talk  contribs) replied to the comment I think they're making it too obvious. Check their comments activity for proof it's most likely them... on the article Spelpotatis08/All GWiki users, i would like to hear what you know about a thing.: UH OH GOOGOLOGISTS, RETARD ALERT! RETARD ALERT! WEE WOO WEE WOO! OK this guy is definetely a prime s... (view)

20:04Polymath257 (talk  contribs) replied to the comment > You can find the last digit of a very large powertower by finding cycles in the final digits of sm... on the article EIG520/Cool Modulus Thing: Something along this line is correct, though. I'll give an illustration. Let's determine the last tw... (view)

18:18Binary198 (talk  contribs) edited a reply to the comment Modular exponentiation is one of my favourite topics :) You can compute modular exponentiation by Fe... on the article Binary198/Modular arithmetic: I have heard of the Fermat and Chinese remainder theorems. However, I am not too familiar, and I did... (view)

16:33Grubb257 (talk  contribs) edited a reply to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: A basic result is Fermat's little theorem: If x is relatively prime to n and \( \phi(n) \) is the Eu... (view)

16:25Grubb257 (talk  contribs) edited a reply to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: A basic result is Fermat's little theorem: If x is relatively prime to n and \( \phi(n) \) is the Eu... (view)

16:24Grubb257 (talk  contribs) replied to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: A basic result is Fermat's little theorem: If x is relatively prime to n and \( \phi(n) \) is the Eu... (view)

16:23Binary198 (talk  contribs) replied to the comment Modular exponentiation is one of my favourite topics :) You can compute modular exponentiation by Fe... on the article Binary198/Modular arithmetic: I am aware of the Fermat and Chinese remainder theorems. However, I am not too familiar, and I did n... (view)

04:10P進大好きbot (talk  contribs) replied to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: I note that these are not unique characterisations. For example, you can see h^m^{100n} ≡ h mod 10... (view)

04:06P進大好きbot (talk  contribs) edited a reply to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: > that 7^5^n = 7 mod 10 for all n>0 and n∈ω. It is correct, but in order to prove this, you need ... (view)

02:20P進大好きbot (talk  contribs) replied to the comment Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... on the article Binary198/Modular arithmetic: > that 7^5^n = 7 mod 10 for all n>0 and n∈ω. It is correct, but in order to prove this, you need ... (view)

02:11P進大好きbot (talk  contribs) commented on the article User_blog:EIG520/Cool Modulus Thing: > You can find the last digit of a very large powertower by finding cycles in the final digits of sm... (view)

01:00EIG520 (talk  contribs) edited a comment on the article User_blog:Binary198/Modular arithmetic: Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... (view)

00:32EIG520 (talk  contribs) edited a comment on the article User_blog:Binary198/Modular arithmetic: Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... (view)

00:31EIG520 (talk  contribs) edited a comment on the article User_blog:Binary198/Modular arithmetic: Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... (view)

00:05EIG520 (talk  contribs) commented on the article User_blog:Binary198/Modular arithmetic: Something cool I just found out is that 7^5^n = 7 mod 10 for all n>0 and n∈ω. I think I want to ... (view)
22 March 2022

14:35Kyodaisuu (talk  contribs) edited a reply to the comment What's the approximation of this number? on the article RapsterZeber/RapsterZeber's Number: ... (view)

14:34Kyodaisuu (talk  contribs) replied to the comment What's the approximation of this number? on the article RapsterZeber/RapsterZeber's Number: As 98^99^100 ≈ 10^10^10^2.30073 = 2.3007316198E3 RapsterZeber's Number ≈ 2.3E99 ≈ 10↑↑99.3... (view)

13:32P進大好きbot (talk  contribs) replied to the comment > let S be the set of all formula which are well defined in L. What does the welldefinedness in L m... on the article EIG520/An uncomputable number: Oh, I am sorry that I did not notice that you added the condition about contradiction. In that case,... (view)

13:01EIG520 (talk  contribs) replied to the comment > let S be the set of all formula which are well defined in L. What does the welldefinedness in L m... on the article EIG520/An uncomputable number: Well, I'm pretty sure that checking if formulae contradict eachother should be uncomputable. (view)

11:40KaffeeByte (talk  contribs) commented on the article User_blog:A radom hotdog/Hotdog Number: The number you made, "Tar[SSCG[Tree[Binory[(ZZ....Z....ZZ{{Z, {Z, {....Z....{Z, Z, Z}....Z....}, Z},... (view)

03:53P進大好きbot (talk  contribs) replied to the comment What's the approximation of this number? on the article RapsterZeber/RapsterZeber's Number: I have ever seen similar numbers in this wiki, and also a number which starts from 1. (view)

02:40ARsygo (talk  contribs) commented on the article User_blog:RapsterZeber/RapsterZeber's Number: What's the approximation of this number? (view)

02:20P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Modular arithmetic: Modular exponentiation is one of my favourite topics :) You can compute modular exponentiation by Fe... (view)

01:56P進大好きbot (talk  contribs) replied to the comment > let S be the set of all formula which are well defined in L. What does the welldefinedness in L m... on the article EIG520/An uncomputable number: > that contains something other than the empty string Since every formula is nonempty, it automatic... (view)
21 March 2022

22:34CaptainChurchill (talk  contribs) replied to the comment Oh god the DNA ordinal on the article Antimony Star/about the embi situation: Gods are fodder, as their creations could easily surpass them... (view)

20:30EIG520 (talk  contribs) replied to the comment > let S be the set of all formula which are well defined in L. What does the welldefinedness in L m... on the article EIG520/An uncomputable number: I fixed the first three. About the uncomputability you seem to have answered your own question with... (view)

19:00Kyodaisuu (talk  contribs) edited a reply to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: 3^n mod 10 = [1, 3, 9, 7] (cycle length = 4) shows that for mod 10, 3^0=1, 3^1=3, 3^2=9, 3^3=7, 3^4... (view)

18:34Kyodaisuu (talk  contribs) edited a reply to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: 3^n mod 10 = [1, 3, 9, 7] (cycle length = 4) shows that for mod 10, 3^0=1, 3^1=3, 3^2=9, 3^3=7, 3^4... (view)

18:33Kyodaisuu (talk  contribs) edited a reply to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: 3^n mod 10 = [1, 3, 9, 7] (cycle length = 4) shows that for mod 10, 3^0=1, 3^1=3, 3^2=9, 3^3=7, 3^4... (view)

18:32Kyodaisuu (talk  contribs) replied to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: 3^n mod 10 = [1, 3, 9, 7] (cycle length = 4) shows that 3^0=1, 3^1=3, 3^2=9, 3^3=7, 3^4=1 and there... (view)

18:30Kyodaisuu (talk  contribs) replied to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: You can verify by manually calculating it by reading the calculation process shown. Maybe G mod 10 i... (view)

18:28Binary198 (talk  contribs) edited a reply to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: I saw this program yesterday. I didn't really understand how it worked though. (view)

18:28Binary198 (talk  contribs) edited a reply to the comment The first equation is not correct for x=1; 7^1=7 and 7+1=8. But anyway the conclusion is correct; as... on the article Binary198/Modular arithmetic: Oh wait, I need to change it! (view)

18:26Binary198 (talk  contribs) replied to the comment The first equation is not correct for x=1; 7^1=7 and 7+1=8. But anyway the conclusion is correct; as... on the article Binary198/Modular arithmetic: Oh wait I need to change it! (view)

18:26Binary198 (talk  contribs) replied to the comment You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi on the article Binary198/Modular arithmetic: I saw this program yesterday. (view)

18:19Kyodaisuu (talk  contribs) commented on the article User_blog:Binary198/Modular arithmetic: You may also find my program interesting. Try with G mod 100. https://gyafun.jp/ln/gramod.cgi (view)

18:16Kyodaisuu (talk  contribs) edited a comment on the article User_blog:Binary198/Modular arithmetic: The first equation is not correct for x=1; 7^1=7 and 7+1=8. But anyway the conclusion is correct; as... (view)

18:14Kyodaisuu (talk  contribs) commented on the article User_blog:Binary198/Modular arithmetic: The first equation is correct for x=1; 7^1=7 and 7+1=8. But anyway the conclusion is true; as 7^4=1 ... (view)

15:11P進大好きbot (talk  contribs) commented on the article User_blog:EIG520/An uncomputable number: > let S be the set of all formula which are well defined in L. What does the welldefinedness in L m... (view)

11:50KaffeeByte (talk  contribs) commented on the article User_blog:EIG520/An uncomputable number: When it comes to Uncomputable stuff like this, I'm not good at seeing if things are illdefined or n... (view)

07:49Binary198 (talk  contribs) replied to the comment Oh god the DNA ordinal on the article Antimony Star/about the embi situation: No! It can't be! The DNA ordinal is the almighty power of gods! (view)

01:53P進大好きbot (talk  contribs) replied to the comment In my opinion this community is regressing. Today on Discord, people are now claiming that UNOCF was... on the article P進大好きbot/Historical Background of the Illdefinedness of UNOCF: > to do some witchcraft with 1mahlos diagonalizing over all "mahlo limits of mahlos" to make 1mahl... (view)
20 March 2022

23:29CaptainChurchill (talk  contribs) replied to the comment Oh god the DNA ordinal on the article Antimony Star/about the embi situation: There is a version of illdefined SAN that surpasses the DNA Ordinal according to Aarex! (view)

23:23CaptainChurchill (talk  contribs) replied to the comment In my opinion this community is regressing. Today on Discord, people are now claiming that UNOCF was... on the article P進大好きbot/Historical Background of the Illdefinedness of UNOCF: The closest we can get to formalizing UNOCF is to do some witchcraft with 1mahlos diagonalizing ove... (view)

19:06Binary198 (talk  contribs) commented on the article User_blog:Syst3ms/STON 2 : BMS and the Star: This looks extremely impressive! I feel like I could milk this... :kek: (Uhoh, I have acclimatised ... (view)

13:59EIG520 (talk  contribs) edited a reply to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: This isn't really a big number, but I think it will help with my formal language. Here is the outli... (view)

13:48P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I think that I understand little about your idea, (So, they might possibly work, but I am not certai... (view)

12:58EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: This isn't really a big number, but I think it will help with my formal language. Here is the outli... (view)
19 March 2022

22:28ARsygo (talk  contribs) commented on the article User_blog:Starstreet29/A journey to infinity and beyond 2: How about "Large Number Garden Number"? (view)

05:06P進大好きbot (talk  contribs) replied to the comment Is it true that \(\psi_{\chi_M(0)}(1) > \chi_{\psi_{\chi_M(0)}(0)}(0)\)? I can't remember where I he... on the article P進大好きbot/List of common misconceptions about Rathjen's psi: Oops. I did not notice your comment. Fortunately, I answered it to my talk page. Thank you for the q... (view)

02:45P進大好きbot (talk  contribs) commented on the article User_blog:Becanina/Loader's number on PascalABC.NET: @ARsygo I noticed that this blog post is added to main space categories. Could you fix it? (view)

01:30ARsygo (talk  contribs) commented on the article User_blog:DeepLineMadom/List of googolisms bounding update: Can I help you to clean it up? (view)
18 March 2022

23:24P進大好きbot (talk  contribs) commented on the article User_blog:Федор Ежов/Infinity to Absolute Pyowr: Common failure 1.1 Typo (ε in φ(ε,0)) Common failure 2.5 Multiple Use of the Same Symbol (Ω) Com... (view)

15:19Kanrokoti (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: Interesting... (view)

11:15Binary198 (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: I understand now. Thank you! (view)

10:31P進大好きbot (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: Maybe it might be better for me to further explain the historical background. The dom in the origina... (view)

10:09Kyodaisuu (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: Thank you. (view)

10:08P進大好きbot (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: > Does dom stand for domain? Yes, I think so. (view)

10:06P進大好きbot (talk  contribs) edited a reply to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: Yes, you are correct. But I have seen a googologist to misunderstand dom as if it were precisely the... (view)

10:06P進大好きbot (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: Yes, you are correct. But I have seen a googologist to misunderstand that it is precisely cof applie... (view)

10:05Kyodaisuu (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: We know that cof stands for cofinality. Does dom stand for domain? (view)

08:28Binary198 (talk  contribs) replied to the comment It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. on the article Ubersketch/Question: Dom is used for ordinal notations rather than ordinals, if I am not mistaken. (view)
17 March 2022

23:18P進大好きbot (talk  contribs) commented on the article User_blog:Ubersketch/Question: It is a recursive analogue of cof introduced by Buchholz and brought to googology by me. (view)

18:20Binary198 (talk  contribs) replied to the comment A ladder (シチョウ) can continue infinitely. on the article Binary198/Infinite Go: :D By the way, I have sent you a friend request on Discord. (view)

18:15Kyodaisuu (talk  contribs) replied to the comment A ladder (シチョウ) can continue infinitely. on the article Binary198/Infinite Go: So you can infinitely enjoy. Great! (view)

17:27Binary198 (talk  contribs) replied to the comment A ladder (シチョウ) can continue infinitely. on the article Binary198/Infinite Go: Sure, that's possible. But I don't think that's necessarily a bad thing. A funny joke relating to in... (view)

16:50Kyodaisuu (talk  contribs) commented on the article User_blog:Binary198/Infinite Go: A ladder (シチョウ) can continue infinitely. (view)

13:42Binary198 (talk  contribs) replied to the comment > (for ordinal notations, the "dom" or "norm" constructions) I am happy to see "dom" here as a curre... on the article Binary198/New kind of fundamental sequences for ordinals: > Then have you ever proved that any countable infinite limit ordinal admits a cofinal subset of ord... (view)

10:13Kanrokoti (talk  contribs) replied to the comment > (for ordinal notations, the "dom" or "norm" constructions) I am happy to see "dom" here as a curre... on the article Binary198/New kind of fundamental sequences for ordinals: I'm so happy 🐻🐻🐻🐻🐻🐻 (view)

07:58P進大好きbot (talk  contribs) replied to the comment > (for ordinal notations, the "dom" or "norm" constructions) I am happy to see "dom" here as a curre... on the article Binary198/New kind of fundamental sequences for ordinals: > Really? I've never seen such a proof. Then have you ever proved that any countable infinite limit ... (view)

07:49Binary198 (talk  contribs) replied to the comment > (for ordinal notations, the "dom" or "norm" constructions) I am happy to see "dom" here as a curre... on the article Binary198/New kind of fundamental sequences for ordinals: > I am happy to see "dom" here as a currently common strategy, because the one who brought the "dom"... (view)

01:04P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/New kind of fundamental sequences for ordinals: > (for ordinal notations, the "dom" or "norm" constructions) I am happy to see "dom" here as a curre... (view)
16 March 2022

15:55Binary198 (talk  contribs) edited a reply to the comment Anyone having some tasty pies? on the article Binary198/Happy π day!: Yes! One of my friends brought an apple pie. :) (view)

15:52Binary198 (talk  contribs) replied to the comment There's so much more beyond the BHO... Say, the prooftheoretic ordinals of strong theories, or even... on the article Starstreet29/Large number list: They're not welldefined, but they would also be cool for you to add in. (view)

15:13RightLefts (talk  contribs) commented on the article User_blog:Starstreet29/0 TO 𝐀𝐁𝐒𝐎𝐋𝐔𝐓𝐄 𝐈𝐍𝐅𝐈𝐍𝐈𝐓𝐘 (PART 1/2): I have a feeling this is copied from somewhere (view)

14:15Starstreet29 (talk  contribs) edited a reply to the comment There's so much more beyond the BHO... Say, the prooftheoretic ordinals of strong theories, or even... on the article Starstreet29/Large number list: Some people create random numbers above absolute infinity, do I add them in too? (view)

14:15Starstreet29 (talk  contribs) replied to the comment There's so much more beyond the BHO... Say, the prooftheoretic ordinals of strong theories, or even... on the article Starstreet29/Large number list: Some people create random above absolute infinity, do I add them in too? (view)

09:50Kyodaisuu (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: A Japanese mathematician Takayuki Kihara read my Japanese PDF writing that f_w_a^CK is regarded as a... (view)

09:41Kyodaisuu (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: Actually he publishes many lecture notes in Japanese which may be related to googology. http://www.m... (view)

09:41Kyodaisuu (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: Actually he has many lecture notes in Japanese which may be related to googology. http://www.math.mi... (view)

09:22Binary198 (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: Oh great! I’ll probably have a look. (view)

09:19Kyodaisuu (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: A Japanese mathematician Takayuki Kihara read my Japanese PDF writing that f_w_a^CK is regarded as a... (view)

09:19Kyodaisuu (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: A Japanese mathematician Takayuki Kihara read my Japanese PDF writing that f_w_a^CK is regarded as a... (view)

09:19Kyodaisuu (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: A Japanese mathematicial Takayuki Kihara read my Japanese PDF writing that f_w_a^CK is regarded as a... (view)

07:46Binary198 (talk  contribs) replied to the comment Well, I almost understand. Let u(T) be the domain of discourse of the theory T. I see that U(0) = u(... on the article P進大好きbot/First Order Theory beyond Higher Order Set Theory: Okay. (view)

07:30Plain'N'Simple (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: As for keeping the original discussion on track: I'd love to see an answer to C7X's original questio... (view)

07:29Plain'N'Simple (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: As for keeping the original discussion on track: I'd love to see an answer C7X's original question. ... (view)

07:14Plain'N'Simple (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: I'm all for ending it here. From my perspective, this discussion has certainly run its course. (view)

02:16P進大好きbot (talk  contribs) replied to the comment I'm pretty sure \(T = \begin{array}{l} ZF_L + \\ '' \textrm{For an ordinal } \alpha \textrm{, } U(\a... on the article P進大好きbot/First Order Theory beyond Higher Order Set Theory: I am sorry for not noticing your comment. A comment to an old post is not automatically notified by ... (view)

02:13P進大好きbot (talk  contribs) replied to the comment Why did you choose \(\varepsilon_0\) as an ordinal? Was it arbitrary or is there some reason behind ... on the article P進大好きbot/First Order Theory beyond Higher Order Set Theory: Right, coding by prime factorisation or pair function is very good, and is actually frequently used ... (view)

02:11P進大好きbot (talk  contribs) replied to the comment Well, I almost understand. Let u(T) be the domain of discourse of the theory T. I see that U(0) = u(... on the article P進大好きbot/First Order Theory beyond Higher Order Set Theory: > Let u(T) be the domain of discourse of the theory T. I note that "the domain of discource" of T ma... (view)

02:06P進大好きbot (talk  contribs) replied to the comment For this comment, I'll use ST(n) to denote nthorder set theory and CT(n) to denote nthorder class ... on the article P進大好きbot/First Order Theory beyond Higher Order Set Theory: Oh, I did not notice this comment. (A comment to an old post is not automatically notified by the sy... (view)
15 March 2022

15:52Binary198 (talk  contribs) replied to the comment I'm pretty sure \(T = \begin{array}{l} ZF_L + \\ '' \textrm{For an ordinal } \alpha \textrm{, } U(\a... on the article P進大好きbot/First Order Theory beyond Higher Order Set Theory: I think I understand now. I read about interpretations when I was researching model theory. (view)

15:30P進大好きbot (talk  contribs) replied to the comment Is there any prime numbers other than 314159? on the article EIG520/3141 digits of PI (calculated by my own program): Here you are :) 3 is prime, 31 is prime, 314159 is prime. Do we know if there's a limit to how many ... (view)

13:55Binary198 (talk  contribs) replied to the comment Is there any prime numbers other than 314159? on the article EIG520/3141 digits of PI (calculated by my own program): You mean in the expansion of π? I’m not sure, but it’s very likely. (view)

13:45ARsygo (talk  contribs) commented on the article User_blog:EIG520/3141 digits of PI (calculated by my own program): Is there any prime numbers other than 314159? (view)

07:50Binary198 (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: Yes, let's move this to a talk page. (view)

02:1512AbBa (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: @Plain'N'Simple, the disabling account thing is real. On discord there's evidence. (Do you want me t... (view)
14 March 2022

20:09Binary198 (talk  contribs) edited a reply to the comment Sorry, I'm not on the Googology Discord. But I certainly am not anonymous anonymous. Any clues so I ... on the article Spelpotatis08/All GWiki users, i would like to hear what you know about a thing.: @CaptainChurchill This is too easy. Probably not an Edwin sockpuppet, else they would've gotten bloc... (view)

20:08Binary198 (talk  contribs) replied to the comment Sorry, I'm not on the Googology Discord. But I certainly am not anonymous anonymous. Any clues so I ... on the article Spelpotatis08/All GWiki users, i would like to hear what you know about a thing.: @CaptainChurchill This is too easy. (view)

20:06Binary198 (talk  contribs) commented on the article User_blog:Spelpotatis08/All GWiki users, i would like to hear what you know about a thing.: I think they're making it too obvious. Check their comments activity for proof it's most likely them... (view)

19:26Binary198 (talk  contribs) commented on the article User_blog:More than large number garden number!/Uhtriel number: Uhtriel is the yummiest kind of salad, and uhtriel is the yummiest salad number, far superior to cro... (view)

18:07Binary198 (talk  contribs) replied to the comment Anyone having some tasty pies? on the article Binary198/Happy π day!: Yes! One of my friends brought an apple pie. (view)

14:42Binary198 (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: Thanks. Today I think I found a way to partially formalise it and avoid big glaring paradoxes. (view)

14:40Binary198 (talk  contribs) replied to the comment Oh, this perhaps means that my bet succeeded! on the article GamesFan2000/Extended Hybrid Hypermathematics: Haha nice (view)

14:39Binary198 (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: > but for this you get my respect Thank you. I try always to be reasonable and never to use reasonab... (view)

12:35Plain'N'Simple (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: @Binary198 >Hmm... Well I always try to stay away from getting into drama, as I've stated numerous t... (view)

12:32GamesFan2000 (talk  contribs) replied to the comment Oh, this perhaps means that my bet succeeded! on the article GamesFan2000/Extended Hybrid Hypermathematics: LOL (view)

12:32P進大好きbot (talk  contribs) replied to the comment Oh, this perhaps means that my bet succeeded! on the article GamesFan2000/Extended Hybrid Hypermathematics: Oh, we replied simultaneously to Binary198. (view)

12:31P進大好きbot (talk  contribs) replied to the comment Oh, this perhaps means that my bet succeeded! on the article GamesFan2000/Extended Hybrid Hypermathematics: My bet here on that someone would extend GamesFan2000's hybrid hypermathematics. https://googology.f... (view)

12:30GamesFan2000 (talk  contribs) replied to the comment Oh, this perhaps means that my bet succeeded! on the article GamesFan2000/Extended Hybrid Hypermathematics: Pbot commented that he thought someone would use my initial definitions for Hybrid Hypermathematics... (view)

12:28P進大好きbot (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: I am looking forward to seeing your new idea! (view)

10:35Binary198 (talk  contribs) commented on the article User_blog:GamesFan2000/The Diagonalized Concatenation Function: Great! This sounds promising. (view)

10:19GamesFan2000 (talk  contribs) commented on the article User_blog:Binary198/Happy π day!: Anyone having some tasty pies? (view)

10:18Binary198 (talk  contribs) commented on the article User_blog:GamesFan2000/Extended Hybrid Hypermathematics: Yay, cool! Hypermathematics has been gaining a lot of traction recently. (view)

10:18Binary198 (talk  contribs) replied to the comment Oh, this perhaps means that my bet succeeded! on the article GamesFan2000/Extended Hybrid Hypermathematics: What bet? (view)

10:17Binary198 (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: If my PK idea works out, then I should rightfully deserve the title of “More than LNGN”. (view)

08:36P進大好きbot (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: Right, and I do not like this user name ┐ツ┌ (You might remember that Genius88 created an arti... (view)

07:53Binary198 (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: Yeah, it does. The magical uhtriel number. Oh, I just saw that Genius88 changed their name. (view)

02:20P進大好きbot (talk  contribs) commented on the article User_blog:GamesFan2000/Extended Hybrid Hypermathematics: Oh, this perhaps means that my bet succeeded! (view)

01:02P進大好きbot (talk  contribs) commented on the article User_blog:GamesFan2000/Formal definition for Hybrid Hypermathematics: Great, not only because the strength compared to the usual mathematics and the usual hypermathematic... (view)

00:54P進大好きbot (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: > I had an idea for a language that adds a unary function symbol and predicate symbols and takes a c... (view)
13 March 2022

22:39P進大好きbot (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: Oh, thank you! Actually, "spell" sounds like a magic. (view)

22:39Anonymous anonymous person (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: I guess we can't ever win, can't we. Pbot, you're *delusional* for thinking anyone would want to com... (view)

21:49Binary198 (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I thought about it, and I doubt my "HOST beyond FOST beyond HOST" idea is going to work out. But, in... (view)

20:40Binary198 (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I thought about it, and I doubt my "HOST beyond FOST beyond HOST" idea is going to work out. But, in... (view)

20:27Binary198 (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I thought about it, and I doubt my "HOST beyond FOST beyond HOST" idea is going to work out. But, in... (view)

20:23Binary198 (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I thought about it, and I doubt my "HOST beyond FOST beyond HOST" idea is going to work out. But, in... (view)

20:22Binary198 (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I thought about it, and I doubt my "HOST beyond FOST beyond HOST" idea is going to work out. But, in... (view)

20:20Binary198 (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I thought about it, and I doubt my "HOST beyond FOST beyond HOST" idea is going to work out. But, in... (view)

20:17Binary198 (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I doubt my HOST beyond FOST beyond HOST is going to work out today. But, I had an idea for a languag... (view)

17:42Kyodaisuu (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: Thanks! (view)

17:38Binary198 (talk  contribs) replied to the comment I did not know the spell of Uhtriel. on the article More than large number garden number!/Uhtriel number: Minor correction, @Kyodaisuu and @P進大好きbot (sorry if this is annoying), I would say spelling... (view)

16:53Binary198 (talk  contribs) commented on the article User_blog:GamesFan2000/Formal definition for Hybrid Hypermathematics: Cool! I still prefer regular mathematics, but this is pretty cool. (view)

16:52Binary198 (talk  contribs) commented on the article User_blog:Starstreet29/Large number list: There's so much more beyond the BHO... Say, the prooftheoretic ordinals of strong theories, or even... (view)

16:45P進大好きbot (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: You are inconsistent, because you actually blocked me as an admin due to your personal reasoning, wh... (view)

16:45Plain'N'Simple (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: Oh, I'm afraid that C7X's has been quite consistent in his avoidance of "drama" (meaning: his avoida... (view)

16:44Binary198 (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: > Oh, I'm afraid that C7X's has been quite consistent in his avoidance of "drama" (meaning: his avoi... (view)

16:42Binary198 (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: > Do you just have an ITTM laying around? Yeah, I bought one the other day from the local store. It'... (view)

14:38Plain'N'Simple (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: Oh, I'm afraid that C7X's has been quite consistent in his avoidance of "drama" (meaning: his avoida... (view)
12 March 2022

22:34Binary198 (talk  contribs) replied to the comment > For functions f1,f2,⋯,fk, compk is a function with arity k I think that what you actually wanted... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: I will try and fix or clarify this tomorrow. It is getting late for me. (view)

22:31Binary198 (talk  contribs) commented on the article User_blog:Starstreet29/0 TO 𝐀𝐁𝐒𝐎𝐋𝐔𝐓𝐄 𝐈𝐍𝐅𝐈𝐍𝐈𝐓𝐘 (PART 1/2): Hmm... Interesting... (view)

08:02Binary198 (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: Ok. (view)

08:01Binary198 (talk  contribs) replied to the comment It is faster than SGH and is googologically comparable to SGH when g_α outgrows f_ω. on the article Binary198/Kind of fastgrowing hierarchy: Yes, hopefully this could work. (view)

07:17P進大好きbot (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: OK. Then it is good to keep them deleted from the main space due to the notability issue. If they ha... (view)

03:16Kyodaisuu (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: Personally I don't think they are worth shown at the main space with many disclaimers. As it is tech... (view)
11 March 2022

23:33P進大好きbot (talk  contribs) replied to the comment > For functions f1,f2,⋯,fk, compk is a function with arity k I think that what you actually wanted... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: Could you specify the domains and the codomains of comp_k and diag_k? (Referring to "functions" f_k'... (view)

23:31ARsygo (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: To me, I'll just keep it archived instead of restoring, but if someone (any admin) decides to restor... (view)

23:23P進大好きbot (talk  contribs) replied to the comment It is faster than SGH and is googologically comparable to SGH when g_α outgrows f_ω. on the article Binary198/Kind of fastgrowing hierarchy: Oh, a constant c? I did not expect it, but it sounds interesting if we can prove the existence for o... (view)

23:20P進大好きbot (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: I wait for opinions by others (especially you, ARsygo, and kyodaisuu). If nobody has a positive opin... (view)

23:15P進大好きbot (talk  contribs) replied to the comment This is also commutative when only using addition or only using multiplication as another advantage ... on the article GamesFan2000/My first nondrama related post in almost two years: Hybrid Hypermathematics: I also wanted to point out the same property! It is actually a good property. (view)

19:28EIG520 (talk  contribs) edited a comment on the article User_blog:GamesFan2000/My first nondrama related post in almost two years: Hybrid Hypermathematics: This is also commutative when only using addition or only using multiplication as another advantage ... (view)

19:20Binary198 (talk  contribs) edited a reply to the comment It is faster than SGH and is googologically comparable to SGH when g_α outgrows f_ω. on the article Binary198/Kind of fastgrowing hierarchy: However, the big cost is of course the growth rate, with \(s_{\Gamma_0}(n)\) only being comparable t... (view)

17:57Binary198 (talk  contribs) replied to the comment Usually, the following things are conventionally compared: FOA(n) = fω1CK(n), where FOA  the sma... on the article Emlightened/A Largest Number: I think "Lβ ⊨ NBG" would fit better. (view)

17:38Binary198 (talk  contribs) replied to the comment This is also commutative when only using addition or only using multiplicative as another advantage ... on the article GamesFan2000/My first nondrama related post in almost two years: Hybrid Hypermathematics: Oh yeah, I didn't realize that! Cool! (view)

16:41EIG520 (talk  contribs) commented on the article User_blog:GamesFan2000/My first nondrama related post in almost two years: Hybrid Hypermathematics: This is also commutative when only using addition or only using multiplicative as another advantage ... (view)

16:04Binary198 (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: You have a point. I see that ARsygo has archived the pages. Should I restore the pages to the mainsp... (view)

15:57Binary198 (talk  contribs) replied to the comment > For functions f1,f2,⋯,fk, compk is a function with arity k I think that what you actually wanted... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: All of them have been fixed. Sorry for the delay. (view)

15:53Binary198 (talk  contribs) replied to the comment It is faster than SGH and is googologically comparable to SGH when g_α outgrows f_ω. on the article Binary198/Kind of fastgrowing hierarchy: However, the big cost is of course the growth rate, with \(s_{\Gamma_0}(n)\) only being comparable t... (view)

13:55Binary198 (talk  contribs) replied to the comment It is faster than SGH and is googologically comparable to SGH when g_α outgrows f_ω. on the article Binary198/Kind of fastgrowing hierarchy: I prefer this, since we can more accurately describe growth rates like \(f_{n \uparrow \uparrow n}(n... (view)

12:38P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Kind of fastgrowing hierarchy: It is faster than SGH and is googologically comparable to SGH when g_α outgrows f_ω. (view)

06:04

00:05P進大好きbot (talk  contribs) replied to the comment To me... can I just archive the pages in my userspace by restoring them? on the article Kyodaisuu/Undefined numbers of hypermathematics: If they are just undefined but are coined in the source, it might even be better to restore them in ... (view)

00:01ARsygo (talk  contribs) commented on the article User_blog:Kyodaisuu/Undefined numbers of hypermathematics: To me... can I just archive the pages in my userspace by restoring them? (view)
10 March 2022

23:59P進大好きbot (talk  contribs) edited a reply to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: You are inconsistent, because you actually blocked me as an admin due to your personal reasoning, wh... (view)

23:59P進大好きbot (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: You are inconsistent, because you actually blocked me as an admin due to your personal reasoning, wh... (view)

23:04P進大好きbot (talk  contribs) replied to the comment A related description for Ω^Ω and 2^2^…2^{Ω+1} = ε_{Ω+1} can be found in my (Japanese) blog p... on the article Polymath257/Well Ordered Classes: I am sorry to be too lazy to have no translation. I just picked up the example because I wanted to i... (view)

23:00EIG520 (talk  contribs) commented on the article User_blog:Maptastic/Beefy Burger: Isn't beefy burger smaller than something like {5,5,5,5,5,5,5} because BEAF is that powerful? Possi... (view)

22:54C7X (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: I use this site to talk about math, not carry on drama. The GWiki server is not only now under a new... (view)

22:48P進大好きbot (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: I do not understand why you ask me questions, even though you ignored my questions related to harass... (view)

22:46C7X (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: (Also this makes me think how unimaginably monstrously fastgrowing f_δ would be, where δ is the l... (view)

22:25C7X (talk  contribs) replied to the comment > so we could say that it has a growth rate of \(f_{\omega_1^{\textrm{CK}}}\) in the FGH, for... on the article Ecl1psed276/Growth rate of oracle Turing machines: @P進大好きbot Would you say this is because while BB₂ is definable by an arithmetical formula,... (view)

22:03Polymath257 (talk  contribs) replied to the comment A related description for Ω^Ω and 2^2^…2^{Ω+1} = ε_{Ω+1} can be found in my (Japanese) blog p... on the article Polymath257/Well Ordered Classes: Any possibility of an English translation? Or, at least, a rundown of the idea? (view)

21:02Kyodaisuu (talk  contribs) replied to the comment I agree. I will delete them. on the article Kyodaisuu/Undefined numbers of hypermathematics: Thank you. (view)

20:56Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/Japanese Googologists and Japanese Contributors to Googology: Cool! (view)

20:45Binary198 (talk  contribs) commented on the article User_blog:Kyodaisuu/Undefined numbers of hypermathematics: I agree. I will delete them. (view)

14:52Binary198 (talk  contribs) replied to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: Oh, I see. (view)

13:49P進大好きbot (talk  contribs) edited a reply to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: It might be easier to imagine if you take a specific model. When you are working in ZFC + Inaccessib... (view)

13:48P進大好きbot (talk  contribs) replied to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: It might be easier to imagine if you take a specific model. When you are working in ZFC + Inaccessib... (view)

13:38Binary198 (talk  contribs) replied to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: Hmm… (view)

11:21P進大好きbot (talk  contribs) replied to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: > subcollections of V, meaning that it’s domain of discourse is the powerset of V, since any subco... (view)

10:16Binary198 (talk  contribs) edited a reply to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: LittlePeng9 says that in SOST, variables can range over subcollections of V, meaning that it’s dom... (view)

10:16Binary198 (talk  contribs) replied to the comment It depends on how you define second order set theory. You can define it in that way, but the power o... on the article Binary198/Question: LittlePeng9 says that in SOST, variables can range over subcollections of V, meaning that it’s dom... (view)

09:09P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Question: It depends on how you define second order set theory. You can define it in that way, but the power o... (view)

02:25EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Oh ok (view)

02:17P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > also may I use your definition of the formal language of ZFC set theory used in the CoRayo functio... (view)

01:56EIG520 (talk  contribs) edited a reply to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Once I create one I will probably make a new blog post for it since it will be an entirely new thing... (view)

01:53EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Once I create one I will probably make a new blog post for it since it will be an entirely new thing... (view)

01:28P進大好きbot (talk  contribs) edited a reply to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: Well, I think that you are underestimating yourself. You can precisely argue (needless to say, much ... (view)

01:27P進大好きbot (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: Well, I think that you are underestimating yourself. You can precisely argue (needless to say, much ... (view)

01:19P進大好きbot (talk  contribs) replied to the comment So here I am, in the comments section of a blog post I've been told to ignore. on the article P進大好きbot/math tag test (please ignore this): Welcome to the comment section! (view)

01:16P進大好きbot (talk  contribs) edited a comment on the article User_blog:Polymath257/Well Ordered Classes: A related description for Ω^Ω and 2^2^…2^{Ω+1} = ε_{Ω+1} can be found in my (Japanese) blog p... (view)

01:15P進大好きbot (talk  contribs) commented on the article User_blog:Polymath257/Well Ordered Classes: A related description for Ω^Ω and 2^2^…2^{Ω+1} = ε_{Ω+1} can be found in my (Japanese blog po... (view)
9 March 2022

21:34Binary198 (talk  contribs) replied to the comment If j's codomain is V, j need not map an ordinal to an ordinal, in which case "j(κ)≤j(λ)" doesn't... on the article Binary198/Pseudolarge cardinals: That wouldn't work, since \(^+\) is not injective. But a good idea! (view)

21:32Polymath257 (talk  contribs) replied to the comment If j's codomain is V, j need not map an ordinal to an ordinal, in which case "j(κ)≤j(λ)" doesn't... on the article Binary198/Pseudolarge cardinals: Might I suggest adding a condition like \( j(\alpha^+ )=j(\alpha )^+ \) for all ordinals? (view)

21:29Binary198 (talk  contribs) replied to the comment What do you intend \( j(\aleph_1 ) \) to be? Notice that \( \aleph_1 \) is regular and not weakly in... on the article Binary198/Pseudolarge cardinals: Don't worry. (view)

21:26Binary198 (talk  contribs) replied to the comment If j's codomain is V, j need not map an ordinal to an ordinal, in which case "j(κ)≤j(λ)" doesn't... on the article Binary198/Pseudolarge cardinals: Aah, you have another good point. (view)

21:17Polymath257 (talk  contribs) edited a reply to the comment What do you intend \( j(\aleph_1 ) \) to be? Notice that \( \aleph_1 \) is regular and not weakly in... on the article Binary198/Pseudolarge cardinals: I don't think that fixes anything. What do you want \( j(\aleph_1 ) \) to be? If it is less than or ... (view)

21:16Polymath257 (talk  contribs) replied to the comment What do you intend \( j(\aleph_1 ) \) to be? Notice that \( \aleph_1 \) is regular and not weakly in... on the article Binary198/Pseudolarge cardinals: I don't think that fixes anything. What do you want \( j(\aleph_1 ) \) to be? If it is less than or ... (view)

21:12C7X (talk  contribs) commented on the article User_blog:Binary198/Pseudolarge cardinals: If j's codomain is V, j need not map an ordinal to an ordinal, in which case "j(κ)≤j(λ)" doesn't... (view)

21:10C7X (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: > I am sorry, but I have no idea. It might be good for you yourself with other members who can analy... (view)

18:46Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/math tag test (please ignore this): So here I am, in the comments section of a blog post I've been told to ignore. (view)

16:59Binary198 (talk  contribs) replied to the comment What do you intend \( j(\aleph_1 ) \) to be? Notice that \( \aleph_1 \) is regular and not weakly in... on the article Binary198/Pseudolarge cardinals: Good point. I changed it. (view)

16:13Polymath257 (talk  contribs) commented on the article User_blog:Binary198/Pseudolarge cardinals: What do you intend \( j(\aleph_1 ) \) to be? Notice that \( \aleph_1 \) is regular and not weakly in... (view)

11:48P進大好きbot (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: The formulation of your oraclebased theory refers to a formula φ in an unspecified language, but i... (view)

10:33Binary198 (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: This is the previous oraclebased theory. (view)

10:32Binary198 (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: Recently I made a theory involving oracle machines. But I doubt that truth, truth on truth, truth on... (view)

08:58Binary198 (talk  contribs) replied to the comment I just made my own transfinite FGH! No system of fundamental sequences is specified, but it should w... on the article P進大好きbot/Transfinite FGH Notation: Oh, okay. Then this is proof that my transfinite FGH ordinal notation is better than my transfinite ... (view)

08:40P進大好きbot (talk  contribs) replied to the comment I just made my own transfinite FGH! No system of fundamental sequences is specified, but it should w... on the article P進大好きbot/Transfinite FGH Notation: On the other hand, you are considering any fixed system of fundamental sequences for ordinals below ... (view)

07:50Binary198 (talk  contribs) replied to the comment I just made my own transfinite FGH! No system of fundamental sequences is specified, but it should w... on the article P進大好きbot/Transfinite FGH Notation: The usual FGH with respect to the fundamental sequences for Veblen function. (view)

04:28P進大好きbot (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: I am sorry, but I have no idea. It might be good for you yourself with other members who can analyse... (view)

04:05P進大好きbot (talk  contribs) replied to the comment I just made my own transfinite FGH! No system of fundamental sequences is specified, but it should w... on the article P進大好きbot/Transfinite FGH Notation: I did not notice this comment, and am sorry for replying too late. > Then, Λ(n) grows approximately... (view)

03:46C7X (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: @P進大好きbot Do you know where to find upcoming googology competitions? Kanrokoti wasn't aware ... (view)

03:38P進大好きbot (talk  contribs) replied to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: > the function could outgrow the fgh by just a little. So the function definition up there is essent... (view)

02:51P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > Does this look like a decent start? As far as you refer to definability, you always need to specif... (view)

02:36KaffeeByte (talk  contribs) replied to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: I scrapped the idea from the realization that, even if it did work, it would be nowhere as powerful ... (view)

02:15EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I have this idea where basically it's: fin(n) is the smallest number a∈⍵ larger than any number ... (view)

01:18EIG520 (talk  contribs) edited a reply to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: So the problem is with any theory capable of producing berry's paradox? In which case I'm trying to... (view)

01:17EIG520 (talk  contribs) edited a reply to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: So the problem is with any theory capable of producing berry's paradox? In which case I'm trying to... (view)

01:04P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I usually use first order logic as a foundation, but some experts (Emlightened and Hexirp) are based... (view)

00:56P進大好きbot (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: Right, I am always waiting for a larger valid googolism! (view)

00:51P進大好きbot (talk  contribs) replied to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: > fgh Of course, you need to define fgh_α because it is undefined for a general ordinal α of cof =... (view)

00:46EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: So the problem is with any theory capable of producing berry's paradox? In which case I'm trying to... (view)

00:32P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: First order predicate logic has a specific rule of syntax, which does not permit to refer to English... (view)

00:15GamesFan2000 (talk  contribs) replied to the comment Hopefully this may cause some movement in the largest valid googolism. on the article P進大好きbot/How to Define Uncomputable Large Functions: Pbot and I discussed ways to potentially build on the concept of the LNGN in a comment thread on th... (view)
8 March 2022

23:13EIG520 (talk  contribs) commented on the article User_blog:P進大好きbot/How to Define Uncomputable Large Functions: Hopefully this may cause some movement in the largest valid googolism. (view)

20:32EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: What is it that can't be justified in first order predicate logic? (view)

20:03Binary198 (talk  contribs) commented on the article User_blog:Literally Legendary/RING function: Sounds interesting. I don't quite understand "dividing a subsequent string into two new strings, swa... (view)

20:01Binary198 (talk  contribs) replied to the comment Going to take a break from my hiatus to say one word: What. on the article Trisintemo/Trakaplex: Yes. I agree: WHAT IS THIS??? (view)

19:59Binary198 (talk  contribs) commented on the article User_blog:Trisintemo/Blowjobwhiletwerkingillion Page Deleted?: While it may be a large number, I am doubling down on my decision to delete the page, as I am afraid... (view)

19:12Binary198 (talk  contribs) replied to the comment Γρεατ! Τηις ςιλλ βε θσεφθλ. Wait, why is my keyboard set to Greek… on the article P進大好きbot/How to Define Uncomputable Large Functions: The holy grail of mathematicians. (view)

18:19KaffeeByte (talk  contribs) edited a reply to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: Well, the working definition would be this(Note this is not fully defined) *Denote On as the class o... (view)

18:14Ubersketch (talk  contribs) commented on the article User_blog:Trisintemo/Trakaplex: Going to take a break from my hiatus to say one word: What. (view)

14:40KaffeeByte (talk  contribs) edited a reply to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: Well, the working definition would be this(Note this is not fully defined) *Denote On as the class o... (view)

14:34KaffeeByte (talk  contribs) replied to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: Well, the working definition would be this(Note this is not fully defined) *Denote On as the class o... (view)

14:24P進大好きbot (talk  contribs) replied to the comment Γρεατ! Τηις ςιλλ βε θσεφθλ. Wait, why is my keyboard set to Greek… on the article P進大好きbot/How to Define Uncomputable Large Functions: I expect this world to be the place where everyone is talking about mathematics :D (view)

14:13P進大好きbot (talk  contribs) edited a reply to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: I note that even the usual FGH for a countable transfinite (recursive) ordinal is not a computable f... (view)

14:12P進大好きbot (talk  contribs) replied to the comment I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... on the article P進大好きbot/How to Define Uncomputable Large Functions: I note that even the usual FGH for a countable (recursive) ordinal is not a computable function (cf.... (view)

12:53KaffeeByte (talk  contribs) commented on the article User_blog:P進大好きbot/How to Define Uncomputable Large Functions: I have been experimenting with an extension of FGH involving uncountables. And it obviously is meant... (view)

12:37Binary198 (talk  contribs) replied to the comment Γρεατ! Τηις ςιλλ βε θσεφθλ. Wait, why is my keyboard set to Greek… on the article P進大好きbot/How to Define Uncomputable Large Functions: Haha. (view)

12:15GamesFan2000 (talk  contribs) replied to the comment Γρεατ! Τηις ςιλλ βε θσεφθλ. Wait, why is my keyboard set to Greek… on the article P進大好きbot/How to Define Uncomputable Large Functions: Oh dear, the dark timeline where everyone speaks in ordinal (view)

10:37P進大好きbot (talk  contribs) replied to the comment Γρεατ! Τηις ςιλλ βε θσεφθλ. Wait, why is my keyboard set to Greek… on the article P進大好きbot/How to Define Uncomputable Large Functions: Thank you! A Greek keyboard is useful when we handle ordinals. (view)

08:14Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/How to Define Uncomputable Large Functions: Γρεατ! Τηις ςιλλ βε θσεφθλ. Wait, why is my keyboard set to Greek… (view)

07:43Binary198 (talk  contribs) replied to the comment Great! It hasn't been translated yet though... on the article Kanrokoti/θψ function: Awesome! 🐠🐠🐠 (view)

05:08Kanrokoti (talk  contribs) replied to the comment Great! It hasn't been translated yet though... on the article Kanrokoti/θψ function: Now translation has been done!!!!🐻🐻🐻🐻🐻🐻 (view)

03:07P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > ZFC+English? as meta theory > I do need a meta theory that is capable of causing berry's paradox i... (view)

02:52EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: ZFC+English? as meta theory I do need a meta theory that is capable of causing berry's paradox in or... (view)

02:32P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: The current problem is the use of "equal", which is a predicate in X rather than one in the meta the... (view)

02:11EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Oh. I thought that a meta theory was the internal theory Given that "equal" is the thing that is cau... (view)

01:47P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: If it is not a specific one, there is no axiom which ensure the welldefinedness of the predicates "... (view)

01:33EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: >when you use meta theory, you need to define it I'm unsure what you mean to define, since this is m... (view)

01:28P進大好きbot (talk  contribs) replied to the comment Thanks. I'm sure this will help amateur googologists who want to make their own uncomputable functio... on the article P進大好きbot/How to Define Uncomputable Large Functions: It is my pleasure. (view)

01:19Literally Legendary (talk  contribs) edited a comment on the article User_blog:P進大好きbot/How to Define Uncomputable Large Functions: Thanks. I'm sure this will help amateur googologists who want to make their own uncomputable functio... (view)

01:16Literally Legendary (talk  contribs) commented on the article User_blog:P進大好きbot/How to Define Uncomputable Large Functions: Great. (view)

00:53P進大好きbot (talk  contribs) edited a reply to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > that has a variable equal to m in the encoding for integers specified in X. The equality is an for... (view)

00:51P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > that has a variable equal to m in the encoding for integers specified in X. The equality is an for... (view)

00:35EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I define a system as a collection of consistent axioms paired with a language and encodings for inte... (view)
7 March 2022

23:37P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: But Sat is defined only for FOST. So the abuse of Sat for L is Common failure 9.5 Intuitive Abuse of... (view)

23:14EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I've had to sleep and go to school and stuff, and in that time I've been thinking of ways to fix the... (view)

21:09Binary198 (talk  contribs) commented on the article User_blog:DeepLineMadom/List of googolisms bounding update: Great! Thanks DeepLineMadom for cleaning up the wiki. (view)

17:48KaffeeByte (talk  contribs) replied to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: Just stop commenting on this, just stop. I am sick of getting notifications from people replying to ... (view)

15:22Binary198 (talk  contribs) replied to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: Yes, I agree. I thought we finished this conversation a while ago. (view)

12:55P進大好きbot (talk  contribs) replied to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: I do not feel good to see the blog post by the globally blocked racist (including a personal attack ... (view)

12:47KaffeeByte (talk  contribs) edited a reply to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: Lets get some sort of record here for ´most replies to a comment on a blog post on the googology wi... (view)

12:47KaffeeByte (talk  contribs) replied to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: Lets get some sort of record here for ´most comments on a blog post on the googology wiki' (view)

11:12Binary198 (talk  contribs) replied to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: Lol nice. I play piano too, but I’ve not heard of Moskowski. (view)

10:5412AbBa (talk  contribs) replied to the comment You logic fails. I show what you need to add: > iff Jα<nJβ, i.e. Jα is a Σn elementary submodel ... on the article ReflectingOrdinal/A proof of termination of BMS: "Moskowski collapse" Moskowski is a composer, not a mathematician, I played some of his pieces befor... (view)

02:55P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > I haven't run into 8.4 and 8.5 Concerning 8.5, you have already referred to the definability in "g... (view)

02:04EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I haven't run into 8.4 and 8.5 so I assume this means I'll have to define 'simulate' and I'll run in... (view)

01:23P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > Should I use FOST instead of Turing machines? It depends on how to fix the other parts. When you u... (view)

01:11EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Should I use FOST instead of Turing machines? My decision for using Turing machines was really only ... (view)

00:50P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > For some reason I think of languages as extensions to computable models. It is not true. A languag... (view)

00:16EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: For some reason I think of languages as extensions to computable models. This means that some langu... (view)
6 March 2022

23:05P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Combined recursion and diagonalization to the severe extremities of computability: > For functions f1,f2,⋯,fk, compk is a function with arity k I think that what you actually wanted... (view)

22:57P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > Is this what you mean to change? > A system has a constructability of 0 iff its language has the a... (view)

22:53P進大好きbot (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: > assigns a wellordering to the minimal code By the way, is it a correct syntax? I have seen the us... (view)

19:24Binary198 (talk  contribs) edited a reply to the comment According to Wikipedia the enumerating function of primes is primitive recursive, do you know if tha... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: Sorry, I mean the source which is cited in Wikipedia right after the highlighted sentence, not the s... (view)

19:16Binary198 (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: I hope its fixed. Now I realise how hard it is to make a welldefined notation like this. Also, do y... (view)

19:12Binary198 (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: Hmmmmm... (view)

19:11Binary198 (talk  contribs) replied to the comment According to Wikipedia the enumerating function of primes is primitive recursive, do you know if tha... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: Sorry, I mean the source which is cited in Wikipedia right after the source, not the source you gave... (view)

19:02EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Is this what you mean to change? I define a system as a collection of consistent axioms paired with ... (view)

19:00C7X (talk  contribs) replied to the comment According to Wikipedia the enumerating function of primes is primitive recursive, do you know if tha... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: No problem! (The source is only a screenshot) (view)

16:58P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > you can construct any Turing machine It does not make sense, because the notion of "Turing machine... (view)

14:58EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: "a language L has the ability to simulate a Turing machine" means that you can construct any Turing ... (view)

14:36P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Then what do "a language L has the ability to simulate a Turing machine" and "all valid expressions ... (view)

14:23EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I meant the language of the system, not the system itself. (view)

14:14P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: What do "a system X has the ability to simulate a Turing machine" and "all valid expressions in a sy... (view)

14:04EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I define a system as a collection of consistent axioms paired with a language. A system has a constr... (view)

13:44P進大好きbot (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: It is my pleasure. By the way, you defined f(n) for any n∈N, but is "N" a typo of "C^N"? (Otherwis... (view)

13:37P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: > Would it make sense for a language, such as FOST, to be Turing complete? I do not know a terminolo... (view)

13:09EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Would it make sense for a language, such as FOST, to be Turing complete? Also do I need to ensure th... (view)

10:55Binary198 (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: I saw it, and it helped me successfully fix it. Thanks for linking it. (view)

10:00P進大好きbot (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: > Hmm, how do I fix this... I think that the blog post which I linked here is helpful: https://goo... (view)

09:54P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: I completely understand your intention now :D (view)

08:58Binary198 (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > Oh, then what does "Kilo is 3, Mega is 4, Giga is 5" mean? Oh, I don't know why I wrote that. I me... (view)

08:58Binary198 (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: So if this number is intended to be 200!^10, then it should be called yottafaxul, rather than hellaf... (view)

08:57Binary198 (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > Your statement is "Mega is 3, Giga is 4", which is obviously wrong. Yes, that's wrong. Kilo is 3, ... (view)

08:57Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > Oh, then what does "Kilo is 3, Mega is 4, Giga is 5" mean? Oh, I don't know why I wrote that. I me... (view)

08:53Binary198 (talk  contribs) replied to the comment > where code is the function that assigns a wellordering to the code of a Turing machine which comp... on the article Binary198/Constructing uncomputable wellorderings  take 2: > a Turing machine which computes a given wellordering is not unique. Now it's the minimal code of ... (view)

08:49P進大好きbot (talk  contribs) commented on the article User_blog:Binary198/Constructing uncomputable wellorderings  take 2: > where code is the function that assigns a wellordering to the code of a Turing machine which comp... (view)

08:46P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > However, people will probably understand if you say "kilo is 3". > Actually, 10^{3n} is the nth SI... (view)

07:58Binary198 (talk  contribs) replied to the comment According to Wikipedia the enumerating function of primes is primitive recursive, do you know if tha... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: The source is acting weird though, when I click on it, it only gives me the first page. (view)

07:57Binary198 (talk  contribs) replied to the comment According to Wikipedia the enumerating function of primes is primitive recursive, do you know if tha... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: Oh, thanks C7X! I was looking on the article for prime numbers, not the article for primitive recurs... (view)

07:47Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: @P進大好きbot Can you have a look at my fixed WO? (view)

07:29Binary198 (talk  contribs) commented on the article User_blog:P進大好きbot/New Notation up to ChurchKleene Ordinal: I assume the relation \(<_{OT}\) has order type \(\omega_1^{\text{CK}}\). Then, I wonder how it woul... (view)

07:21Binary198 (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > is it correct to say "kilo is 3" rather than "kilo is 10^3" in English? Well, I would recommend sa... (view)

07:20Binary198 (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > is it correct to say "kilo is 3" rather than "kilo is 10^3" in English? Well, I would recommend sa... (view)

07:20Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > is it correct to say "kilo is 3" rather than "kilo is 10^3" in English? Well, I would recommend sa... (view)

07:17P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > We both know I am not confident about it. Genius88 might be believing that it is 3 rather than 10^... (view)

07:03Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: > mega in SI prefix is different from 3 We both know Genius88 means \(10^3\) rather than plain \(3\)... (view)

07:00P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: @Binary198 I clarified that "mega in SI prefix is different from 3", and Genius88 literally denied i... (view)

07:00Binary198 (talk  contribs) replied to the comment > Let ≤_C be a wellordering on it, defined as Unfortuantely, ≤_C is not a wellordering because... on the article Binary198/Uncomputable wellorderings for the ChurchKleene ordinal and beyond: @P進大好きbot I think I know how to fix this. Maybe check my blog in a couple hours. (view)

06:46More than large number garden number! (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Okay. (view)

06:45Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Sorry? I don't really understand what you and pbot are arguing about, I'm just chiming in with my k... (view)

06:36More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: So that's it. That was it! (view)

06:35More than large number garden number! (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: So that's it. (view)

06:33Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Mega in faxul naming system \(=\) 3 \(\neq\) Mega in SI system \(=\) 4. (view)

06:32Binary198 (talk  contribs) commented on the article User_blog:LittlePeng9/Higher order set theory: Great! This is awesome. However, \(O\) as defined in this blog post does not work. The order type of... (view)

06:31More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: @Binary198 What do you mean? I think "there is Megafaxul." (view)

06:31More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: @Binary198 What do you mean? There is Megafaxul. (view)

06:31C7X (talk  contribs) replied to the comment According to Wikipedia the enumerating function of primes is primitive recursive, do you know if tha... on the article Binary198/Combined recursion and diagonalization to the severe extremities of computability: image This is the Wikipedia quote, I can add suggestions to your document too (view)

06:30More than large number garden number! (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: There is Megafaxul. (view)

06:26Binary198 (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: I never realised mega in faxul naming system \(\neq\) mega in SI. (view)

05:52P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: You can choose whatever correct. The problem was that "No" was incorrect. (view)

05:42More than large number garden number! (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: So, what should I say? (view)

05:39P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Then one easy solution is not to say "No" in that way. (view)

05:32P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Indeed, it might be better to solve the first problem, because how to redefine FOST might depend on ... (view)

05:15More than large number garden number! (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: I knew it. I just didn't have enough words. (view)

03:22EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: I think that it would be probably be better for me to redefine the "collection of statements and wha... (view)

03:05P進大好きbot (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: I clarified that even if the order of mega in the naming system of faxul is 3, mega itself is 10^6, ... (view)

03:04P進大好きbot (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Well, then "FOST" in your terminology is different from "FOST" introduced in the article, as it is a... (view)

03:00P進大好きbot (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: I clarified that even if the order of mega in the naming system of faxul is 3, mega itself is 10^6, ... (view)

02:59P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: I clarified that "the actual value of mega" and "the ordinal of mega in the naming system of faxul" ... (view)

02:41More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Sorry, I knew that "Mega is 3" and "Giga is 4" were wrong. but, I said "Mega is 3, Giga is 4, in fax... (view)

02:40More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: No. Mega is 3, Giga is 4, in faxul. (view)

02:40More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: No. Mega is 3, Giga is 4, in faxul. (view)

02:40More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: No. Mega is 3, Giga is 4, in faxul. (view)

02:40More than large number garden number! (talk  contribs) edited a reply to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Sorry, I knew that "3 for Mega" and "4 for Giga" were wrong. but, I said "Mega is 3, Giga is 4, in f... (view)

02:39More than large number garden number! (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: Sorry, I knew that "3 for Mega" and "4 for Giga" were wrong. but, I said "Mega is 3, Giga is 4, in f... (view)

02:36EIG520 (talk  contribs) replied to the comment > A system has a constructability of 0 iff it is turing complete and no more powerful than a turing ... on the article EIG520/Are these definitions OK?: Unless I'm being incredibly stupid (which is a possibility), this is a collection of statements and ... (view)

02:31P進大好きbot (talk  contribs) replied to the comment > The hellafaxul is a number expressed as (((((((((((200!)!)!)!)!)!)!)!)!) using Factorial. This can... on the article More than large number garden number!/Hellafaxul: @Genius88 I said "Please read what you actually wrote." Please do not ignore it, and please read wha... (view