Track the most recent social changes to the community on this page.
Filters
24 October 2021
-
10:31
-
10:08
-
09:31
-
08:56
-
08:55
23 October 2021
-
22:35
-
19:11Binary198 (talk | contribs) commented on the article User_blog:Hexirp/(2021-10-23) New Policy: ... (view)
-
11:04Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Okay. No problem! (view)
-
10:29P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Sounds great, but I am currently waiting for judges for my 6 entries submitted to 3 other googology ... (view)
-
09:43Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: I'm hosting a large number contest, would you like to have an entry (or be a judge of it)? (view)
-
09:22P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: It is my pleasure. (view)
-
09:22P進大好きbot (talk | contribs) edited a reply to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: I assumed that you fully understood what a meta-theory means, because you asked me nothing when I ci... (view)
-
09:03Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Okay. Thanks for feedback as always. (view)
-
08:15P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: I assumed that you fully understood what a meta-theory means, because you asked me nothing when I ci... (view)
-
07:44Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: I don't understand what you mean by "meta-theory", so never mind, I guess this will just be another ... (view)
-
07:39P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: In order to answer the question, please clarify the meta theory, which you need to define the theory... (view)
-
07:31Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: > ∀A_0 is a formal string in the formula, and hence is not the actual quantification What do you m... (view)
-
07:28Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Okay, sorry, I will fix these errors (view)
-
04:48Hexirp (talk | contribs) replied to the comment As I can read Japanese I react before translating. I also think that blog post is better than person... on the article Hexirp/(2021-10-23) New Policy: Yes, that was a bit rash. (view)
-
04:47Hexirp (talk | contribs) edited a reply to the comment As I can read Japanese I react before translating. I also think that blog post is better than person... on the article Hexirp/(2021-10-23) New Policy: > Indeed, there was a user who silently updated his or her personal website after obvious errors wer... (view)
-
04:41P進大好きbot (talk | contribs) replied to the comment As I can read Japanese I react before translating. I also think that blog post is better than person... on the article Hexirp/(2021-10-23) New Policy: Right, although I would like not to call out a specific user under the belief that the user will nev... (view)
-
02:49Hexirp (talk | contribs) replied to the comment As I can read Japanese I react before translating. I also think that blog post is better than person... on the article Hexirp/(2021-10-23) New Policy: > Indeed, there was a user who silently updated his or her personal website after obvious errors wer... (view)
-
00:32P進大好きbot (talk | contribs) replied to the comment I guess that n? in the right hand side of the definition of n? is a typo of (n-1)? and you forgot to... on the article Arcioko/unnamed factorial: The current policy does not allow a blog post to be the first source of an article, although the pol... (view)
22 October 2021
-
23:57P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: > always pointing out all of my errors As I said, I am not pointing out all errors. There are still ... (view)
-
23:44P進大好きbot (talk | contribs) replied to the comment As I can read Japanese I react before translating. I also think that blog post is better than person... on the article Hexirp/(2021-10-23) New Policy: It might be even better to prohibit to add a new link to a personal website as the first source of a... (view)
-
23:35P進大好きbot (talk | contribs) commented on the article User_blog:Hexirp/(2021-10-23) New Policy: ... (view)
-
22:21Arcioko (talk | contribs) edited a reply to the comment I guess that n? in the right hand side of the definition of n? is a typo of (n-1)? and you forgot to... on the article Arcioko/unnamed factorial: Corrected, thoughts? And also can i make it into an article, it would be the first thing i made that... (view)
-
21:58Arcioko (talk | contribs) replied to the comment I guess that n? in the right hand side of the definition of n? is a typo of (n-1)? and you forgot to... on the article Arcioko/unnamed factorial: Corrected, thoughts? (view)
-
21:57Arcioko (talk | contribs) replied to the comment I guess that n? in the right hand side of the definition of n? is a typo of (n-1)? and you forgot to... on the article Arcioko/unnamed factorial: Yea sorry about that, correcting rn (view)
-
21:21Spelpotatis (talk | contribs) commented on the article User_blog:Sbiis Saibian/Addendum on New LNS: Will you ever go into fast growing hierarchy beyond gamma-0? I would love to see you go into extende... (view)
-
20:25Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: I think it should be fixed now, and once again thanks for always pointing out all of my errors :) (view)
-
18:12Binary198 (talk | contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: Acar Afghan salad Ambrosia Arab salad Asinan Banana salad Bean salad Beet salad Bok l'hong Caesar sa... (view)
-
17:16Kyodaisuu (talk | contribs) commented on the article User_blog:Hexirp/(2021-10-23) New Policy: As I can read Japanese I react before translating. I also think that blog post is better than person... (view)
-
16:19GerfloJoroZ (talk | contribs) replied to the comment Mmm tasty salad on the article GerfloJoroZ/Making Salad: Name every salad (view)
-
15:35P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: It is my pleasure :3 (view)
-
15:33Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Okay. Thanks for the help. (view)
-
08:49Binary198 (talk | contribs) replied to the comment Fact: There has never been "ε_{;+1}" in UNOCF, not even merely an idea. on the article C7X/OCF using a to rank-into-rank cardinal: Lol the police be like (view)
-
07:06P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Good. Then it is good to keep in mind that what you can use are only what you have already defined a... (view)
-
06:41Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: ... Okay :( I will fix it later. (view)
-
03:10P進大好きbot (talk | contribs) commented on the article User_blog:Arcioko/unnamed factorial: I guess that n? in the right hand side of the definition of n? is a typo of (n-1)? and you forgot to... (view)
-
03:08P進大好きbot (talk | contribs) edited a reply to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: > Okay, fixed! Hopefully, this is now the biggest number! :) No. It is ill-defined. Also, it is real... (view)
-
03:06P進大好きbot (talk | contribs) edited a reply to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: > Okay, fixed! Hopefully, this is now the biggest number! :) No. It is ill-defined. Also, it is real... (view)
-
03:03P進大好きbot (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: > Okay, fixed! Hopefully, this is now the biggest number! :) No. It is ill-defined. Also, it is real... (view)
-
01:05Arcioko (talk | contribs) replied to the comment I think is grow speed between f_3 and f_4 on the article Arcioko/refactorial: Same (view)
21 October 2021
-
18:13Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Okay, fixed! Hopefully, this is now the biggest number! :) (view)
-
12:57Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: I’m not able to fix them rn, but I will in like an hour and a half. (view)
-
12:53Binary198 (talk | contribs) replied to the comment It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... on the article Binary198/Sushi number🍣🐠🐡: Okay, oopsie. I will make sure to fix them. (view)
-
01:38P進大好きbot (talk | contribs) edited a comment on the article User_blog:Binary198/Sushi number🍣🐠🐡: It is ill-defined because... Common failure 9.7 Incomplete Language of a New Foundation Common failu... (view)
20 October 2021
-
23:10P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/Sushi number🍣🐠🐡: It is ill-defined because... Common failure 9.6 Incomplete New Foundation (Use of a logic, which is ... (view)
19 October 2021
-
22:48
-
17:30Binary198 (talk | contribs) commented on the article User_blog:P進大好きbot/Successor OCF Based on Weakly Compact Cardinals: Cute :) (view)
-
11:22Williy luk (talk | contribs) replied to the comment [9,5] is undefined, so I try to define yore notation: x^y=[x,y] X^y^z=[x,[y,z]] X^^y=x{2}y=[x,2,y] X... on the article Williy luk/My notation: https://www.youtube.com/channel/UCwwqjNYPjPh6RcvCrxiQvtg If you want to know more (view)
-
00:57P進大好きbot (talk | contribs) replied to the comment Okay. I think this was a good idea! on the article P進大好きbot/Creation of "Googology in Japan" template: Thank you. (view)
18 October 2021
-
19:56Binary198 (talk | contribs) commented on the article User_blog:P進大好きbot/Creation of "Googology in Japan" template: Okay. I think this was a good idea! (view)
-
13:01P進大好きbot (talk | contribs) replied to the comment > As you all probably know The written defining formula is wrong... Well, unfortunately the definiti... on the article Binary198/There's PTOs, why not MTOs?: In addition, the defining formula does not work for an arbitrally theory T, i.e. you need to add mor... (view)
17 October 2021
-
11:57Binary198 (talk | contribs) commented on the article User_blog:GerfloJoroZ/Making Salad: Mmm tasty salad (view)
-
07:35Binary198 (talk | contribs) replied to the comment > As you all probably know The written defining formula is wrong... Well, unfortunately the definiti... on the article Binary198/There's PTOs, why not MTOs?: > The written defining formula is wrong... Oops! Sorry, I will fix it. > It is actually related to m... (view)
16 October 2021
-
12:50P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/There's PTOs, why not MTOs?: > As you all probably know The written defining formula is wrong... Well, unfortunately the definiti... (view)
15 October 2021
-
13:06Binary198 (talk | contribs) replied to the comment Googology at its finest on the article P進大好きbot/CoFish number 7: Googology at its 🐠 est (view)
13 October 2021
-
11:5412AbBa (talk | contribs) replied to the comment \(\beta\) is not undetermined! As I analysed here, \(\beta=T_\omega\) in UNOCF. on the article Hyp cos/Catching hierarchy fails: On another note, if we look at how the \(\psi_1(\Omega)\) works in an exponential OCF, then could th... (view)
-
05:08MultiSoul (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: Yæ (view)
-
05:02B4423 (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: Yeeeeeeeeeeaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa (view)
12 October 2021
-
07:38Tsskyx (talk | contribs) commented on the article User_blog:Literally Legendary/I need ideas: Find a way to extend the definition of the Veblen function for uncountable ordinals (it must yield c... (view)
11 October 2021
-
15:37Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/Stacked up-arrow notation: Lol I had a crazy idea! Like the FGH, you can add FSes and get \(a[\uparrow \uparrow^\omega \uparrow... (view)
-
09:39Clyde1000^1000 (talk | contribs) commented on the article User_blog:Arcioko/refactorial: I think is grow speed between f_3 and f_4 (view)
-
09:35Clyde1000^1000 (talk | contribs) commented on the article User_blog:Arcioko/nested-refactorial: That thing at the end would me very handy for NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNRF_10... (view)
10 October 2021
-
09:11Binary198 (talk | contribs) commented on the article User_blog:Binary198/Analysis of galaxy function: This is a pretty short analysis, check out the main Galaxy function article if you've finished readi... (view)
-
06:4212AbBa (talk | contribs) edited a comment on the article User_blog:Rgetar/Two types of ordering, fundamental sequences beyond ε₀, new version of Ordinal Explorer: I found a [W(2)+e(W+w^w^w)] after [W(2)+e(W^W)] which was probably intended to be [W(2)+e(W^W^w)] (view)
-
06:4212AbBa (talk | contribs) commented on the article User_blog:Rgetar/Two types of ordering, fundamental sequences beyond ε₀, new version of Ordinal Explorer: I found a [W(2)+e(W+w^w^w)] after [W(2)+e(W^W)] which was probably intended to be [W(2)+e(W^W^W)] (view)
9 October 2021
-
09:46P進大好きbot (talk | contribs) edited a comment on the article User_blog:TheGoogologist/Journey to Infinity: Part 1: > Unlike in the previous series, where I simply made an ill-defined salad function, It is good to ke... (view)
-
09:45P進大好きbot (talk | contribs) commented on the article User_blog:TheGoogologist/Journey to Infinity: Part 1: > Unlike in the previous series, where I simply made an ill-defined salad function, It is good to ke... (view)
8 October 2021
-
03:25Clyde1000^1000 (talk | contribs) commented on the article User_blog:Williy luk/How to make a illion: true (view)
7 October 2021
-
08:43Clyde1000^1000 (talk | contribs) replied to the comment [9,5] is undefined, so I try to define yore notation: x^y=[x,y] X^y^z=[x,[y,z]] X^^y=x{2}y=[x,2,y] X... on the article Williy luk/My notation: Also, define 5 entry arrays and 6 entries as well!!!1!!1 (view)
-
02:37Clyde1000^1000 (talk | contribs) commented on the article User_blog:Williy luk/My tier 4 illion: WHY DID YOU POST A EMPTY BLOG??? (view)
-
02:33Clyde1000^1000 (talk | contribs) commented on the article User_blog:Williy luk/My notation: [9,5] is undefined, so I try to define yore notation: x^y=[x,y] X^y^z=[x,[y,z]] X^^y=x{2}y=[x,2,y] X... (view)
6 October 2021
-
15:53Literally Legendary (talk | contribs) replied to the comment How about a computable uparrow notation? on the article Literally Legendary/I need ideas: Okay (view)
-
14:42Binary198 (talk | contribs) replied to the comment The limit of SSAN with no separators \(= \psi(I_{\omega, 0, 0})\) on the article Binary198/One of my array notations: SSAN (superspeedy): > when people use FGH without understanding the actual definition of FGH and ordinals I understand t... (view)
-
14:39Binary198 (talk | contribs) replied to the comment This looks kinda cool i guess, I dunno on the article Kanrokoti/Weak K-psi function: Yay!!! :) (view)
-
14:31KarmaAnecdotes (talk | contribs) commented on the article User_blog:Literally Legendary/I need ideas: What about a function that makes large numbers using complex numbers, like 2i+5, or 105i+77. (view)
-
06:50Binary198 (talk | contribs) replied to the comment The limit of SSAN with no separators \(= \psi(I_{\omega, 0, 0})\) on the article Binary198/One of my array notations: SSAN (superspeedy): Okay, lemme specify fundamental sequences. (view)
-
04:10Clyde1000^1000 (talk | contribs) commented on the article User_blog:Literally Legendary/I need ideas: Or a primitive recursive? (view)
-
02:30Clyde1000^1000 (talk | contribs) commented on the article User_blog:Clyde1000^1000/f notation: I think is grow 'fast' (view)
5 October 2021
-
22:33P進大好きbot (talk | contribs) commented on the article User_blog:Literally Legendary/I need ideas: How about a computable uparrow notation? (view)
-
22:33P進大好きbot (talk | contribs) edited a reply to the comment The limit of SSAN with no separators \(= \psi(I_{\omega, 0, 0})\) on the article Binary198/One of my array notations: SSAN (superspeedy): The notation is ill-defined due to Common failure 5.6 Unspecified Fundamental Sequences. This error ... (view)
-
22:32P進大好きbot (talk | contribs) replied to the comment The limit of SSAN with no separators \(= \psi(I_{\omega, 0, 0})\) on the article Binary198/One of my array notations: SSAN (superspeedy): The notation is ill-defined because Common failure 5.6 Unspecified Fundamental Sequences. This error... (view)
-
20:06Kanrokoti (talk | contribs) replied to the comment This looks kinda cool i guess, I dunno on the article Kanrokoti/Weak K-psi function: Now it's fixed!! (view)
-
18:51Binary198 (talk | contribs) commented on the article User_blog:Binary198/One of my array notations: SSAN (superspeedy): The limit of SSAN with no separators \(= \psi(I_{\omega, 0, 0})\) (view)
-
15:06Kel26 (talk | contribs) replied to the comment gothouzillionogol is defined as 37 kedrillion and guess what... a kedrillion&... on the article Sbiis Saibian/Introduction to Googology: 100000 IQ (view)
-
12:53Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: This is smart (view)
-
12:30KarmaAnecdotes (talk | contribs) replied to the comment Common failure 7.5 Confusion of Ordinal Functions and Ordinal Notations on the article KarmaAnecdotes/This Ordinal thing I made: Ok, after reading the article, this is an OCF (view)
-
11:39Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Let's compare \(s = \textrm{三}_0(\textrm{三}_1(0)+\textrm{三}_1(0)+\textrm{三}_1(0))\) and \(t ... (view)
-
11:32Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: This is smart (view)
-
11:29Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: INB4, the binary relation s < t is intended to be the "lexicographical order". Let's compare \(s = \... (view)
-
11:28Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: INB4, the binary relation s < t is intended to be the "lexicographical order". Let's compare \(s = \... (view)
-
11:25Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: INB4, the binary relation s < t is intended to be the "lexicographical order". Let's compare \(s = \... (view)
-
09:22Clyde1000^1000 (talk | contribs) commented on the article User_blog:Epicdoge121/Judy's Number: J64>G64(grahm's numbar) (view)
-
09:14Clyde1000^1000 (talk | contribs) replied to the comment See also Cloudy's list The Best of Deleted Googologisms, a sort of "hall of shame" for bad googol... on the article Sbiis Saibian/Introduction to Googology: Pooillion=10^Gartansgahhjjahhdijoopuwagoowwadanzogubumpoombanoogol Gartansgahhjjahhdijoopuwagoowwada... (view)
-
08:53Clyde1000^1000 (talk | contribs) replied to the comment Seems like a good idea but a lot of work. A few things: Don't forget sources for every name Don'... on the article Cookiefonster/Know what we should do?: Hello your 'blowers' should be 'bowers' (view)
-
08:40Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: And rule 4.1, comparing the sān function and addition. (view)
-
08:39Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Hey Kanrokoti, in the binary relation s < t, how does rule 3.2, comparing addition and the sān func... (view)
-
05:3812AbBa (talk | contribs) commented on the article User_blog:Nayuta Ito/PEGG entered The Eon Of Undefined: Do we abandon the array notation (view)
-
05:3512AbBa (talk | contribs) commented on the article User_blog:PsiCubed2/Psi's Ever-Growing Googolism (PEGG): RIP PEGG 5/8/2017 ~ 9/29/2021 (view)
4 October 2021
-
10:36Binary198 (talk | contribs) edited a reply to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Oops (view)
-
10:35Binary198 (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Hello (view)
-
10:34Binary198 (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Lol (view)
-
00:50Kanrokoti (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Well... 😳 (view)
-
00:43Kanrokoti (talk | contribs) edited a reply to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Nice work! TBH, I recommend you to copy my (and p進大好きbot's) way of writing definitions (if y... (view)
-
00:38P進大好きbot (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: >TBO Is it a shorthand of "To Be Onest"? (view)
-
00:09Kanrokoti (talk | contribs) edited a reply to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Nice work! TBO, I recommend you to copy my (and p進大好きbot's) way of writing definitions (if y... (view)
-
00:08Kanrokoti (talk | contribs) edited a reply to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Nice work! TBO, I recommend you to copy my (and p進大好きbot's) way of writing definitions (if y... (view)
-
00:06Kanrokoti (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: Nice work! TBO, I recommend you to copy my (and p進大好きbot's) way of writing definitions (if y... (view)
3 October 2021
-
22:48P進大好きbot (talk | contribs) edited a reply to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: > I didn't know that, but I didn't really know what to call it. Generally speaking, it might be good... (view)
-
22:45P進大好きbot (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: > I didn't know that, but I didn't really know what to call it. Generally speaking, it might be good... (view)
-
16:36Binary198 (talk | contribs) replied to the comment If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... on the article Binary198/Si function 四: > I myself has ever defined 四 function. I didn't know that, but I didn't really know what to call ... (view)
-
15:26P進大好きbot (talk | contribs) edited a comment on the article User_blog:Binary198/Si function 四: If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... (view)
-
15:24P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/Si function 四: If you intend a cousin of my 三 function, I myself has ever defined 四 function. User blog:P進大... (view)
-
15:01P進大好きbot (talk | contribs) replied to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: > the amount of as in B I guess that you meant Y. > That's all I can think of because you never gave... (view)
-
14:48Binary198 (talk | contribs) replied to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: ... Hmmm lemme think If X and Y both consist of a, then X < Y if the amount of as in X < the amount ... (view)
-
14:11Binary198 (talk | contribs) commented on the article User_blog:Binary198/Formalized and fixed plus notation: I'll just get rid of the "binary relation" and turn this into a notation with correspondence to ordi... (view)
2 October 2021
-
11:33P進大好きbot (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: It is my pleasure! By the way, please check your talk page and the talk page of Buchholz's hydra. Pe... (view)
-
10:05Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Thank you for all your helpful advice! :) (view)
-
09:14P進大好きbot (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Please do not mind it! People frequently make mistakes, and we are not blaming mistakes. What we sho... (view)
-
07:57Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Sorry! 🤦 (view)
-
05:28P進大好きbot (talk | contribs) replied to the comment 1: : does equal 1 on the article MinersHavenM43/Arrorial: No. You are wrong. Could you read what is written in my comment? What you need to understand is that... (view)
-
05:04Clyde1000^1000 (talk | contribs) edited a reply to the comment 1: : does equal 1 on the article MinersHavenM43/Arrorial: If 2: : = 2 and 2=1^2 And 3: : = 16 and 16=1^(2^^3) This means that 1; : is just 1 (view)
-
05:03Clyde1000^1000 (talk | contribs) replied to the comment 1: : does equal 1 on the article MinersHavenM43/Arrorial: If 2: : = 2 and 2=1^2 And 3: : = big number and 'big number'=1^2^^3 This means that 1; : is just 1 (view)
1 October 2021
-
22:44Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > What exactly is this function intended to do? ・as a mathematical intention Although I named this... (view)
-
22:39P進大好きbot (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > since, 三_2(0) and ω share the same FS, 三_2(0)=ω. No. You are repeating the same mistake. Ple... (view)
-
20:44Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Thanks for the help! So, for example, we have: The fundamental sequences for \(\textrm{三}_2(1) = \... (view)
-
18:02Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Namely, for any \(a \in T\), \(\textrm{三}_a(1)[t] = \underbrace{\textrm{三}_a(0)+ \cdots +\textrm... (view)
-
17:49Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Idk what is actual value of them (even if you clarify its meaning). So, I just wrote FSes: Note that... (view)
-
17:47Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Idk what is actual value of them (even if you clarify its meaning). So, I just wrote FSes: Note that... (view)
-
17:46Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Idk what is actual value of them (even if you clarify its meaning). So, I just wrote FSes: Note that... (view)
-
17:45Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Idk what is actual value of them (even if you clarify its meaning). So, I just wrote FSes: Note that... (view)
-
15:53Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > What exactly is this function intended to do? ・as a mathematical intention Although I named this... (view)
-
15:53Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > What exactly is this function intended to do? ・as a mathematical intention Although I named this... (view)
-
15:51Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > What exactly is this function intended to do? ・as a mathematical intention Although I named this... (view)
-
15:27Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Sorry, I keep getting stuff confused, but I will get the hang of things eventually! (view)
-
15:25Binary198 (talk | contribs) replied to the comment This looks kinda cool i guess, I dunno on the article Kanrokoti/Weak K-psi function: Well, I'm looking forward to seeing it fixed. (view)
-
13:10Kanrokoti (talk | contribs) replied to the comment This looks kinda cool i guess, I dunno on the article Kanrokoti/Weak K-psi function: Thanks, unfortunately, this current definition is ill-defined. (There are some infinite loops) I'm w... (view)
-
10:49Binary198 (talk | contribs) commented on the article User_blog:Kanrokoti/Weak K-psi function: This looks kinda cool i guess, I dunno (view)
-
10:34P進大好きbot (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Then what does "the ordinal that the term in the notation represents." mean? As I said, I am afraid ... (view)
-
10:30P進大好きbot (talk | contribs) replied to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: (I note that my comment above referred to your comment before you edited it.) So, before going beyon... (view)
-
10:18Binary198 (talk | contribs) replied to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: Okay, well thank you a lot. (view)
-
10:18Binary198 (talk | contribs) edited a reply to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: A well-ordering is, in the way which I understand it, a relation between the elements of a set such ... (view)
-
10:15Binary198 (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: I'm a big fan of your ordinal notations, keep up the good work! :) (view)
-
10:12Binary198 (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Okay, sorry for making that maths error. Also, I’m confused. What exactly is this function intende... (view)
-
10:11Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > What do you mean by "the actual value" of a term in a notation? Sorry for my ambiguous language! W... (view)
-
09:29Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Okay, sorry for making that maths error. Also, I’m confused. What exactly is this function intende... (view)
-
03:03P進大好きbot (talk | contribs) replied to the comment 1: : does equal 1 on the article MinersHavenM43/Arrorial: It is non-sense to state so without fixing a definition. If you define 1:: as 1, then it is tautolog... (view)
-
00:32Clyde1000^1000 (talk | contribs) commented on the article User_blog:MinersHavenM43/Arrorial: 1: : does equal 1 (view)
30 September 2021
-
23:28Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: \(\textrm{三}_0(\textrm{三}_0(\textrm{三}_2(0)+\textrm{三}_1(\textrm{三}_2(0))))[1]\) \(= \text... (view)
-
23:26Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > you can actually use MathJax in comments... Oh! I didn't realized that it's already fixed. Thank y... (view)
-
23:21Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > you can actually use MathJax in comments... Oh! I didn't realized that it's already fixed. Thank y... (view)
-
23:20Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: \(\textrm{三}_0(\textrm{三}_0(\textrm{三}_2(0)+\textrm{三}_1(\textrm{三}_2(0))))[1]\) (FS rule ... (view)
-
23:20Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: \(\textrm{三}_0(\textrm{三}_0(\textrm{三}_2(0)+\textrm{三}_1(\textrm{三}_2(0))))[1]\) (FS rule ... (view)
-
23:19Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: \(\textrm{三}_0(\textrm{三}_0(\textrm{三}_2(0)+\textrm{三}_1(\textrm{三}_2(0))))[0]\) (FS rule ... (view)
-
23:17Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > you can actually use MathJax in comments... Oh! I didn't realized that it's already fixed. Thank y... (view)
-
23:16Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > you can actually use MathJax in comments... Oh! I didn't realized that it's already fixed. Thank y... (view)
-
22:42P進大好きbot (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: > I hope that's correct, but then If it is actually an extension of my 三 function, then none of th... (view)
-
22:37P進大好きbot (talk | contribs) replied to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: I am not asking a definition of a well-ordering, but am asking that of a well-ordering on OT., becau... (view)
-
17:56Binary198 (talk | contribs) replied to the comment > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... on the article Binary198/Formalized and fixed plus notation: A well-ordering is, in the way which I understand it, a relation between the elements of a set such ... (view)
-
17:36Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: So, we have: \(\Xi_0(\Xi_0(\Xi_2(0)+\Xi_1(\Xi_2(0))))[0] = \Xi_1(\Xi_1(0))\) \(\Xi_0(\Xi_0(\Xi_2(0)+... (view)
-
17:33Binary198 (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: I'm a big fan of your ordinal notations, keep up the good work (view)
-
17:32Binary198 (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: That's quite long, thanks for explaining it, could you below just put a list of the first few elemen... (view)
-
17:31Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: That's quite long, thanks for explaining it, could you below just put the first fiew elements of the... (view)
-
17:28Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: By the way, you can actually use MathJax in comments like you do in normal pages e.g. \(\textrm{Text... (view)
29 September 2021
-
02:0112AbBa (talk | contribs) commented on the article User_blog:PsiCubed2/Fractional Psi Levels (extended table, summarized): ~=- •=$ (view)
28 September 2021
-
22:58P進大好きbot (talk | contribs) commented on the article User_blog:KarmaAnecdotes/This Ordinal thing I made: Common failure 7.5 Confusion of Ordinal Functions and Ordinal Notations (view)
-
14:04P進大好きbot (talk | contribs) edited a reply to the comment Unfortunately, such a function is ill-defined because of the common failure: 6.1 Intuitive Pattern M... on the article Tsskyx/A system utilizing uncountable ordinals better than OCFs?: Veblen's φ can work beyond Ω. So, if they simply mean uncountable ordinals, then there is no probl... (view)
-
14:02P進大好きbot (talk | contribs) replied to the comment Unfortunately, such a function is ill-defined because of the common failure: 6.1 Intuitive Pattern M... on the article Tsskyx/A system utilizing uncountable ordinals better than OCFs?: I guess that it is just an ill-defined function. One sad thing is that many googologists use functio... (view)
-
13:48Tsskyx (talk | contribs) replied to the comment Unfortunately, such a function is ill-defined because of the common failure: 6.1 Intuitive Pattern M... on the article Tsskyx/A system utilizing uncountable ordinals better than OCFs?: I see. So when Stephen Brooks uses the following notation in his program, what exactly is happening ... (view)
-
13:28P進大好きbot (talk | contribs) commented on the article User_blog:Tsskyx/A system utilizing uncountable ordinals better than OCFs?: Unfortunately, such a function is ill-defined because of the common failure: 6.1 Intuitive Pattern M... (view)
-
04:53P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > So I learned that instead of trying to prove the meaning of a notion which isn't already defined, ... (view)
-
04:51P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The page is good, because the one who posted the question asked an actual reference of the answer an... (view)
-
04:50P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The page is good, because the one who posted the question asked an actual reference of the answer an... (view)
-
04:41Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: So I learned that instead of trying to prove the meaning of a notion which isn't already defined, I ... (view)
-
04:38Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I found this online: "The cardinality of A is the equivalence class of A under the equivalence relat... (view)
-
04:36P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > The axioms I used (maybe not all of them because I might have missed some): Uh, I intended that yo... (view)
-
04:35P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > All I can find when I search "cardinality definition" is "the number of elements in a set," which ... (view)
-
04:26Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >Do you know the definition of the cardinality in the standard mathematics? All I can find when I se... (view)
-
03:48P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > The axioms I used (maybe not all of them because I might have missed some): Uh, I intended that yo... (view)
-
03:4412AbBa (talk | contribs) commented on the article User_blog:Rgetar/Ordinal Explorer Online: Is there a conjecture about the limit of TON in this notation? Is it [[cω]], or is this notation we... (view)
-
03:38P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > The axioms I used (maybe not all of them because I might have missed some): Uh, I intended that yo... (view)
27 September 2021
-
23:13Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >Do you mean a proof formalised by Goedel correspondence? I meant a proof expressed in some mathemat... (view)
-
22:48Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The axioms I used (maybe not all of them because I might have missed some): The cardinality of x is ... (view)
-
22:31P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Do you mean a proof formalised by Goedel correspondence? I just meant a proof in standard mathematic... (view)
-
22:29P進大好きbot (talk | contribs) commented on the article User_blog:GerfloJoroZ/Sam's Number?: > We know that... The second and third lines do not make sense, as Sam's number is as ill-defined as... (view)
-
22:12Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Was it supposed to be a formal proof? (view)
-
12:18P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/Formalized and fixed plus notation: > We then define a well-ordering X<Y on OT like so: It is ill-defined, as what you tried to define i... (view)
-
11:50P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: I am happy to hear that. If something in my answer was not clear, it is perhaps due to my bad explan... (view)
-
11:23Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > Is there any question, which I have not answered? You answered all the questions I asked, thanks f... (view)
-
08:21Jacquesbailhache (talk | contribs) edited a reply to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > So, the one who is required to show a formal definition is you. I think this is a good formal defi... (view)
-
08:20P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > it is defined as "a strictly well-ordered system (OT,<) of formal strings called ordinal terms con... (view)
-
08:09Jacquesbailhache (talk | contribs) edited a reply to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > So, the one who is required to show a formal definition is you. I think this is a good formal defi... (view)
-
08:04Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > So, the one who is required to show a formal definition is you. I think this is a good formal defi... (view)
-
07:49Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: In https://en.wikipedia.org/wiki/Ordinal_notation , an ordinal notation is defined as "a partial fun... (view)
-
07:47P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > Do you mean that it is not required that f_α(n) is computable for any ordinal α ? No, I just mea... (view)
-
07:37Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > As I said, "a way to write ordinals". is an unformalised notion. If you think so, then please fix ... (view)
-
07:36Jacquesbailhache (talk | contribs) edited a reply to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > Then what conflicts the phenomenon that f_α(n) can be computable for a fixed ordinal α? Do you m... (view)
-
07:31Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > Then what conflicts the phenomenon that f_α(n) can be computable for a fixed ordinal α? Do you m... (view)
26 September 2021
-
23:45Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Let's calculate 三_0(三_0(三_2(0)+三_1(三_2(0)))) (Since we can't use mathjax in a comment, I u... (view)
-
23:45Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Let's calculate 三_0(三_0(三_2(0)+三_1(三_2(0)))) (Since we can't use mathjax in a comment, I u... (view)
-
23:44Kanrokoti (talk | contribs) edited a reply to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Let's calculate 三_0(三_0(三_2(0)+三_1(三_2(0)))) (Since we can't use mathjax in a comment, I u... (view)
-
23:41Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Let's calculate 三_0(三_0(三_2(0)+三_1(三_2(0)))) (Since we can't use mathjax in a comment, I u... (view)
-
15:27Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/SMB1-plex: Long-SMB1-plex??? (view)
-
12:54
-
12:53
-
12:52Binary198 (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Could you maybe provide some examples, I find it difficult to understand these super formal definiti... (view)
-
06:50Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/blog post: ok (view)
-
02:00MultiSoul (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: Yeeaaaaaaa (view)
-
01:01Kanrokoti (talk | contribs) replied to the comment This looks like a cool ordinal notation, I like it a lot! on the article Kanrokoti/Non-restricted 三 function: Thank you !! (view)
25 September 2021
-
15:13P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > According to https://en.wikipedia.org/wiki/Computable_function Then what conflicts the phenomenon ... (view)
-
15:06Binary198 (talk | contribs) replied to the comment The computation is wrong, as there is no rule to remove the leftmost "(", which appears when you app... on the article Binary198/Fast-growing combinatorial function I made because I was bored: Yeah, I did think that this didn't stand much of a chance. 😂 (view)
-
14:41P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/Fast-growing combinatorial function I made because I was bored: The computation is wrong, as there is no rule to remove the leftmost "(", which appears when you app... (view)
-
13:52B4423 (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: Yeeeeeee (view)
-
11:51Binary198 (talk | contribs) commented on the article User_blog:Kanrokoti/Non-restricted 三 function: This looks like a cool ordinal notation, I like it a lot! (view)
-
11:18Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: Concerning the expression "ordinal notation", in ordinary language it means "notation for ordinals" ... (view)
-
09:47Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: According to https://en.wikipedia.org/wiki/Computable_function , "a function is computable if there ... (view)
-
09:06P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: Could you tell me what you think that the definition of the computability of a function? (view)
-
08:10Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: The FGH is defined by : \( f_0(n) = n+1 \) \( f_{\alpha+1}(n) = {f_\alpha}^n(n) \) \( f_\alpha(n) = ... (view)
-
08:10Jacquesbailhache (talk | contribs) edited a reply to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: (view)
-
08:09Jacquesbailhache (talk | contribs) edited a reply to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: The FGH is defined by : \( f_0(n) = n+1 \) \( f_{\alpha+1}(n) = {f_\alpha}^n(n) \) \( f_\alpha(n) = ... (view)
-
08:08Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: The FGH is defined by : \( f_0(n) = n+1 \) \( f_{\alpha+1}(n) = {f_\alpha}^n(n) \( f_\alpha(n) = f_{... (view)
-
06:58P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: At least, "we can define an ordinal notation using an OCF if this OCF yields a computable large func... (view)
-
06:45Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: I just ask you if what I said is right, if I have correctly understood. (view)
-
06:39P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > But we can define an ordinal notation using an OCF if this OCF yields a computable large function ... (view)
-
05:58Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: I have understood that an OCF is a function which sends cardinals to recursive countable ordinals, a... (view)
-
01:26P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Great. Then could you tell me precisely what axioms you used to prove the statement? (view)
-
01:20Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >For an exercise, could you prove that it is equivalent to the property that x and y have the same c... (view)
24 September 2021
-
23:22P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Uh, perhaps you missed my question in my last comment. (view)
-
23:20P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: > any ordinal notation gives a way to write ordinals (not all ordinals, Yes! > but only ordinals les... (view)
-
23:07Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I introduced several notions to help shorten "Axiom of Link Existence to Alternate Set of Links" but... (view)
-
18:27Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: Do you agree that any ordinal notation gives a way to write ordinals (not all ordinals, but only ord... (view)
-
17:36Binary198 (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: Okay, sorry! (view)
-
17:35Binary198 (talk | contribs) commented on the article User_blog:Arcioko/array notation idea thing: Okay looks nice i guess (view)
-
17:34Binary198 (talk | contribs) commented on the article User_blog:KarmaAnecdotes/Testing Blog: The latex is really fuzzy, use \(\) instead of <math></math> (view)
-
15:40Arcioko (talk | contribs) replied to the comment Beginner googologist here I have a question... How do you compare googolisms, yea you could look at ... on the article Sbiis Saibian/Introduction to Googology: I know now lol (view)
-
13:57P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: Say, even an expert in this community in early days stated something like "an OCF is an ordinal nota... (view)
-
13:06Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: What I understand is that in summary an ordinal notation is a well ordered set of strings. But "Ever... (view)
23 September 2021
-
23:32P進大好きbot (talk | contribs) replied to the comment That can have a growth rate of w^w. on the article Arcioko/refactorial: I think so. That is why I asked the user. (view)
-
22:45P進大好きbot (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: Thank you. Now I see the source of your misconception. First of all, the => just means an intended s... (view)
-
17:03Arcioko (talk | contribs) replied to the comment That can have a growth rate of w^w. on the article Arcioko/refactorial: Theres no way it can (view)
-
16:28Binary198 (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: "So, I decided to extend it like ψ_A(B) => ψ_0(A,B)" (view)
-
15:20Binary198 (talk | contribs) replied to the comment What is the "lim" in the definition of ε_1? on the article Binary198/Super fast-growing hierarchy (powerful recursion-based function): I know, this is kinda confusing, lemme change it real quick so it does not collide with the usually ... (view)
-
13:32P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: No. First of all, please do not confound a term in an ordinal notation and an ordinal. Those are dis... (view)
-
13:22Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: "Given an ordinal notation, there are several meanings of "fundamental sequences"" : Do you mean the... (view)
-
12:37P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: > *This rule is applied from left to right* What does this mean? > I couldn't find a case of an ill-... (view)
-
12:04KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: I had changed, since those errors, the definition of g to be more like the chained arrows, but with ... (view)
-
09:06P進大好きbot (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: D_1 0 is not Buchholz's ordinal notation, but a term in Buchholz's ordinal notation. The source of B... (view)
-
08:15Jacquesbailhache (talk | contribs) replied to the comment In the FS a[k] = max { b | b < a and L(b) = L(a) + k }, k is a finite number, so it seems to m... on the article Hyp cos/Fundamental Sequences in Taranovsky's Notation: Have you a reference concerning this Buchholz's ordinal notation D_1 0 ? (view)
-
01:07P進大好きbot (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: > Well, it seems to me, that this is a function designed to name and describe large countable ordina... (view)
-
00:52P進大好きbot (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: Also, please check your talk page. (view)
22 September 2021
-
17:23Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: Cool, see you later. 👍 (view)
-
15:47P進大好きbot (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: I see. Anyway, yes, it suffices to add a recursive well-ordering. (The most difficult part is to sho... (view)
-
15:28Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: I have read the definition, not saying I completely understand it. I probably will if I study it eno... (view)
-
15:27Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: Okay, well thanks for all your help! :) (view)
-
15:00Literally Legendary (talk | contribs) replied to the comment We could also create long-SMB-duplex using the following formula: X = (36*83)^(13*16)*3*5*2^5 Y = 29... on the article Literally Legendary/SMB-plex: Cool (view)
-
14:52P進大好きbot (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: > Would this classify as a "notation with a correspondence to ordinals"? Right, but it is still ill-... (view)
-
14:41Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: > Since it lacks a recursive well-ordering, googologists who know ordinal notations immediately noti... (view)
-
14:39Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: And if so, how could I formalise it? (view)
-
14:38Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: Okay, well thanks for helping me out. Would this classify as a "notation with a correspondence to or... (view)
-
13:50P進大好きbot (talk | contribs) replied to the comment What is the "lim" in the definition of ε_1? on the article Binary198/Super fast-growing hierarchy (powerful recursion-based function): A description in wikipedia does not help you here, because I am asking this due to the incocnsitency... (view)
-
13:49Binary198 (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: Well, it seems to me, that this is a function designed to name and describe large countable ordinals... (view)
-
13:47P進大好きbot (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: > I'm not quite sure what an ordinal notation is Then it is good to avoid to use notions whose defin... (view)
-
13:45Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: If I fix the ill-definedness and stuff, could you explain to me how I could formalise it as a proper... (view)
-
13:42Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: I guess you could say this is a "notation with a correspondence to ordinals". (view)
-
13:41Binary198 (talk | contribs) replied to the comment What is the "lim" in the definition of ε_1? on the article Binary198/Super fast-growing hierarchy (powerful recursion-based function): It's kinda weird, IDK why I included it. According to Wikipedia, "In mathematics, the limit of a fun... (view)
-
13:39Binary198 (talk | contribs) replied to the comment This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... on the article Binary198/Plus ordinal notation: I thought you would say that, and to be honest, I'm not quite sure what an ordinal notation is. I wo... (view)
-
13:18P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/Plus ordinal notation: This is ill-defined, and perhaps you are misunderstanding what an ordinal notation means. Could you ... (view)
-
13:13P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/Super fast-growing hierarchy (powerful recursion-based function): What is the "lim" in the definition of ε_1? (view)
-
13:12Binary198 (talk | contribs) replied to the comment Hello. Thank you for appreciating me! Well, unfortunately most parts are ill-defined. First of all, ... on the article Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: Thanks Literally Legendary (view)
-
13:03P進大好きbot (talk | contribs) replied to the comment Well... we need to step up the security game in this wiki,... I know it's a late post, actually. on the article Fivebee2/The raid has gotten much worse... and I mean it.: Although I do not know well about the old vandalism, we do not have such a serious vandalism now. I ... (view)
-
12:22ARsygo (talk | contribs) commented on the article User_blog:Fivebee2/The raid has gotten much worse... and I mean it.: Well... we need to step up the security game in this wiki,... I know it's a late post, actually. (view)
-
12:20ARsygo (talk | contribs) replied to the comment What is L(n)? on the article Ynought/L-n: What's the growth rate of the function? (view)
-
12:11P進大好きbot (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: Could you please explain what "the definition of psi_0(n,m)" means in your sense? I am asking it, be... (view)
-
08:19Binary198 (talk | contribs) commented on the article User_blog:Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: Thank you everyone for your feedback! (view)
-
08:04Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/Googology challenges for you to try: I wanna try: Well-defined version of Little Bigeddon and/or Big Bigeddon (Sasquatch) (view)
-
08:03Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/Random googolisms: Lol what (view)
-
07:42Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/SMB-plex: We could also create long-SMB-duplex using the following formula: X = (36*83)^(13*16)*3*5*2^5 Y = 29... (view)
-
07:40Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/SMB-plex: Precise value: 3.63416474679 × 10^725 Long-SMB-plex precise value: 2.302267075 × 10^16493 Using th... (view)
-
06:52Binary198 (talk | contribs) replied to the comment I agree with P進大好きbot, that it is not fully formalised and the language is undefined, but th... on the article Literally Legendary/Theory of Links Axioms: Oops sorry :/ (view)
-
06:52Binary198 (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: What I'm saying is that he defined psi_0(n, m), but I can't find the definition of psi_1, etc. I do ... (view)
-
04:30Literally Legendary (talk | contribs) replied to the comment I agree with P進大好きbot, that it is not fully formalised and the language is undefined, but th... on the article Literally Legendary/Theory of Links Axioms: I defined the language a week before you posted this comment. (view)
21 September 2021
-
23:44Literally Legendary (talk | contribs) replied to the comment Hello. Thank you for appreciating me! Well, unfortunately most parts are ill-defined. First of all, ... on the article Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: A good start to making sure a number is larger than Large Number Garden Number is making sure the la... (view)
-
22:45P進大好きbot (talk | contribs) replied to the comment I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... on the article Kanrokoti/3 variables ψ which is larger than EBOCF: You are wrong. Perhaps you are confounding an OCF with an ordinal notation or a recursive notation w... (view)
-
17:36Binary198 (talk | contribs) commented on the article User_blog:Kanrokoti/3 variables ψ which is larger than EBOCF: I'm not that experienced, so I may be misunderstanding, but this seems ill-defined as you never defi... (view)
-
17:24Binary198 (talk | contribs) replied to the comment Mono-azideplex = Estate(1, 0) = Estate(0, 0) = 1 Di-azideplex = Estate(2, 0) = Estate(1, 1) = Estate... on the article Literally Legendary/Estate function: Let's see. Mono-azideplex = Estate(1, 0) = Estate(0, 0) = 1 Di-azideplex = Estate(2, 0) = Estate(1, ... (view)
-
15:40Binary198 (talk | contribs) replied to the comment Hello. Thank you for appreciating me! Well, unfortunately most parts are ill-defined. First of all, ... on the article Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: Thanks for all the constructive criticism, I will make sure to fix it. (view)
-
15:13Literally Legendary (talk | contribs) replied to the comment Mono-azideplex = Estate(1, 0) = Estate(0, 0) = 1 Di-azideplex = Estate(2, 0) = Estate(1, 1) = Estate... on the article Literally Legendary/Estate function: I changed it, now is this the case anymore? (view)
-
12:04P進大好きbot (talk | contribs) commented on the article User_blog:Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: Hello. Thank you for appreciating me! Well, unfortunately most parts are ill-defined. First of all, ... (view)
-
10:56Binary198 (talk | contribs) replied to the comment What's the Meaning of "misplaced &"? on the article Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: Sorry, that's a LaTeX error, let me fix it. (view)
-
10:53ARsygo (talk | contribs) commented on the article User_blog:Binary198/"Hyper hierarchy" - Attempting to beat Rayo's number and LNGN, and probably succeeding: What's the Meaning of "misplaced &"? (view)
-
09:35Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/Estate function: Mono-azideplex = Estate(1, 0) = Estate(0, 0) = 1 Di-azideplex = Estate(2, 0) = Estate(1, 1) = Estate... (view)
-
09:28Binary198 (talk | contribs) edited a comment on the article User_blog:Binary198/Numnum-numbers!: (view)
-
01:38P進大好きbot (talk | contribs) replied to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: It became better, but still includes an informal occurrence of natural language in a mathematical fo... (view)
-
01:17Arcioko (talk | contribs) edited a reply to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: Is it better now (view)
-
01:12Arcioko (talk | contribs) replied to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: I believe its fixed its now I guess (view)
20 September 2021
-
14:27Binary198 (talk | contribs) commented on the article User_blog:SelfInvolution/Classic google sites: You legend! (view)
-
14:26Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/Conjecture: Satellite2(1, 1, 1) = Satellite(0, 1, 1) + Satellite(0, 1, 1) = 2 Satellite(1, 2, 3) = Satellite2(0,... (view)
-
14:15Binary198 (talk | contribs) commented on the article User_blog:DAno80/New Lower Bound for TREE(3)?: 😂 (view)
-
14:08Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/New Function Coming Soon...: Sounds cool. (view)
-
14:06Binary198 (talk | contribs) commented on the article User_blog:KarmaAnecdotes/Thought Experiment: This is funny... (in a good way) I wonder what kind of numbers you could make with it. (view)
-
14:04Binary198 (talk | contribs) commented on the article User_blog:Literally Legendary/Theory of Links Axioms: I agree with P進大好きbot, that it is not fully formalised and the language is undefined, but th... (view)
-
13:58Binary198 (talk | contribs) commented on the article User_blog:Binary198/Numnum-numbers!: I think the LaTeX / MathJax is broken, I'm not quite sure. (view)
-
13:48Binary198 (talk | contribs) commented on the article User_blog:RightLefts/Update: Great to hear that. (view)
-
13:43Binary198 (talk | contribs) commented on the article User_blog:Spelpotatis/New googologism: Plexobit: This is a cool idea, and it would be nice to have stuff like a plexobyte i.e. 2^plexobit, plexobytep... (view)
-
08:45ARsygo (talk | contribs) commented on the article User_blog:PlantStarAlpineer0/Other Types of Cosmic Numbers: What's the growth rate of this number? (view)
-
00:08P進大好きbot (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: OK. Then let us enojoy to check g. > - i=p+1, and x=a for any non-negative integers a and p It is a ... (view)
-
00:07P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: OK. Then let us enojoy to check g. > - i=p+1, and x=a for any non-negative integers a and p It is a ... (view)
19 September 2021
-
19:20Binary198 (talk | contribs) commented on the article User_blog:ARsygo/Extensible-E System question: At least 492 googologisms have been coined with hyper-hyper-extended, but they don't have a separate... (view)
-
19:17Binary198 (talk | contribs) commented on the article User_blog:ARsygo/Extensible-E System question: The extension to extended cascading-E notation does exist (it is called hyper-extended cascading-E),... (view)
-
18:45Binary198 (talk | contribs) commented on the article User_blog:MultiSoul/The X Hiearchy: Nice work! This function looks like it has some awesome potential, can't wait to see you expand it f... (view)
-
15:28KarmaAnecdotes (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: So I need to define the codomain of the function so that the term "st(x,y) is empty" is not ill-defi... (view)
-
15:27KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: So I need to define the codomain of the function, got it. (view)
-
15:07P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: > -I define a function st(x,y) for any two non-negative integers x any y. (I guess that "x any y" is... (view)
-
13:47KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: Also, as I have been fixing Chained arrows, I have also been applying the fixes to the other functio... (view)
-
13:40KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: Okay, I will implement that. (view)
-
12:40P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: > *Where "#" is equal to a string of b(amount of) a's* Of course, this is ok. What I meant is not a ... (view)
-
12:25KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: >So, in your convention, 0↑0 = 0, right? It is ok because it is your own definition, but for a fut... (view)
-
08:44Tetramur (talk | contribs) replied to the comment That's virtually impossible... I mean, we need a very "dense" language for the definition. on the article Tetramur/Question about specific big number: The strongest computable function I know is I0 function. I am not sure what is the smallest x satisf... (view)
-
08:01ARsygo (talk | contribs) replied to the comment Maybe you cold make Yi- a number prefix and people could calculate the growth rate of it. on the article GdawgGamerTV/I coin these 20 new numbers.: Is this a random number? (view)
-
04:45P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: > -For any amount of up-arrows n, 0^n0 = 0, and for any positive-integers a and b, 0^na = 0, a^n0 = ... (view)
-
01:16KarmaAnecdotes (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: >Then where does "a" appear in "If x = #,1,#a"? Since you wrote that "(possibly empty)strings # and ... (view)
-
01:14KarmaAnecdotes (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: >Then where does "a" appear in "If x = #,1,#a"? Since you wrote that "(possibly empty)strings # and ... (view)
-
01:13KarmaAnecdotes (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: >Then where does "a" appear in "If x = #,1,#a"? Since you wrote that "(possibly empty)strings # and ... (view)
-
01:10KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: >Then where does "a" appear in "If x = #,1,#a"? Since you wrote that "(possibly empty)strings # and ... (view)
18 September 2021
-
22:54P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: > -I fixed that by correcting the quantifiers to include "a non-negative integer a"' Then where does... (view)
-
17:28KarmaAnecdotes (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: My fixes: >"What is the "non-negative integer" mentioned here?" & "The "a non-negative integer" shou... (view)
-
17:24KarmaAnecdotes (talk | contribs) edited a reply to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: My fixes: >"What is the "non-negative integer" mentioned here?" & "The "a non-negative integer" shou... (view)
-
17:24KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: My fixes: >"What is the "non-negative integer" mentioned here?" & "The "a non-negative integer" shou... (view)
-
09:56Nayuta Ito (talk | contribs) commented on the article User_blog:Tetramur/Question about specific big number: That's virtually impossible... I mean, we need a very "dense" language for the definition. (view)
-
01:47ARsygo (talk | contribs) commented on the article User_blog:Eners49/New notation idea?: When treated !!...!! as multifactorial, it will have a much smaller growth rate, actually. (view)
-
01:40
-
01:36ARsygo (talk | contribs) edited a comment on the article User_blog:Googolplexianito/numero antes del infinito: ¿Estàn mal definidos el número y su serie? (It means: "Is the number and its series ill-defined?"... (view)
-
01:34ARsygo (talk | contribs) commented on the article User_blog:Googolplexianito/numero antes del infinito: ¿Estàn mal definidos el número y su serie? (It means: "Is the number and its series ill-defined?"... (view)
-
00:20P進大好きbot (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: So, let us start from completing "C". > If x = #,0,#a for a non-negative integer > If x = #,1,#a for... (view)
-
00:09P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Great. For an exercise, could you prove that it is equivalent to the property that x and y have the ... (view)
-
00:04P進大好きbot (talk | contribs) replied to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: It has two errors: It does not solve the problem that it includes ellipses. (Please check the link a... (view)
17 September 2021
-
16:15Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: So would it work if I make it so that x \cong y is equivalent to ((x \vec{s} y and y \ves{s} x) or (... (view)
-
15:58Kanrokoti (talk | contribs) replied to the comment The standard form looks like 2-ary 三関数. Perhaps missing "0,"? on the article Kanrokoti/3-variable 三 function: Yeah, I fixed!! Thank you! (view)
-
15:25KarmaAnecdotes (talk | contribs) replied to the comment Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... on the article KarmaAnecdotes/Recursive Factory Function: Ok, I applied those fixes, how do they look? (view)
-
15:19Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >is it intentionl that several of the axioms include free occurrence of z? No. I had used copy/paste... (view)
-
14:21Arcioko (talk | contribs) edited a reply to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: Well uh i added a definition below the examples Looks awfully complex but it actually isnt just see ... (view)
-
14:20Arcioko (talk | contribs) edited a reply to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: Well uh i added a definition below the examples (view)
-
13:52Arcioko (talk | contribs) replied to the comment Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... on the article Arcioko/arcioko's (me) repeat sequnce: Well uh i added a better definition below the examples (view)
-
13:18P進大好きbot (talk | contribs) commented on the article User_blog:Kanrokoti/3-variable 三 function: The standard form looks like 2-ary 三関数. Perhaps missing "0,"? (view)
-
12:49ARsygo (talk | contribs) replied to the comment delta_0↑↑w=e_dekta_0 delta_(n+1)=e_e_...e_delta_n on the article Lord Aspect/SATCLN V: So, what comes after eta? In terms of ordinal, actually. (view)
-
12:45ARsygo (talk | contribs) commented on the article User_blog:MilkyWay90/The Kroutonillion: Thankfully, the croutonillion page got restored. (view)
-
04:29P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: OK, but is it intentionl that several of the axioms include free occurrence of z? Also, if I correct... (view)
-
04:10Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I decided to borrow your wedge, so now the \cong relation is almost certainly not ill-defined, and i... (view)
-
04:09Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I decided to borrow your wedge, so now the \cong relation is almost certainly not ill-defined, and i... (view)
-
03:59ARsygo (talk | contribs) replied to the comment There are so, so many pages of numbers by him. And a majority of them are super short. This kind... on the article MilkyWay90/Should we delete all numbers by Sbiis Saibian?: So, it marked stub, and I added approximations in other notations, to expand it. (view)
-
03:57ARsygo (talk | contribs) commented on the article User_blog:Bubby3/Analysis of Fusible numbers margins: Well, it looks like, there are a lot of blank lines above. (view)
-
03:57Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I decided to borrow your wedge, so now the \cong relation is almost certainly not ill-defined, and i... (view)
-
03:54Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I decided to borrow your wedge, so now the \cong relation is probably not ill-defined. (view)
-
03:17P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: If you directly borrow the wedge, you can write "this is originally introduced by p進大好きbot".... (view)
-
03:12P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: If you directly borrow the wedge, you can write "this is originally introduced by p進大好きbot".... (view)
-
02:58Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: How do you want me to provide credit for your definition? (view)
-
02:53P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The updated formula is still ill-formed. In order to avoid errors, I suggested to define notions and... (view)
-
02:30P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The updated formula is still ill-formed. In order to avoid errors, I suggested to define notions and... (view)
-
02:20Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I have now added an axiom for \doteqdot (view)
-
02:07Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The axiom is finished now, and yes, this is my own idea and my own work. My intention is that if the... (view)
-
02:06Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The axiom is finished now, and yes, this is my own idea and my own work. My intention is that if the... (view)
-
01:58Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >But there is no axiom for \cong. I'm working on it Edit: Now there's an axiom for \cong Edit 2: Som... (view)
-
01:45P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > Axiom of Equal Cardinality: Is it your own idea? It does not look identical to the usual definitio... (view)
-
01:14Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >But there is no axiom for \cong. I'm working on it Edit: Now there's an axiom for \cong Edit 2: Som... (view)
-
01:13Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >But there is no axiom for \cong. I'm working on it Edit: Now there's an axiom for \cong (view)
-
00:50Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >But there is no axiom for \cong. I'm working on it (view)
-
00:49Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I added \neq for inequality, \notin for non-membership, and \cong for equal cardinality I also added... (view)
-
00:42P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > If I add \neq do I also need to add an axiom \forall x \forall y((x \neq y) \leftrightarrow \neg (... (view)
-
00:41P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > If I add \neq do I also need to add an axiom \forall x \forall y((x \neq y) \leftrightarrow \neg (... (view)
-
00:40P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > If I add \neq do I also need to add an axiom \forall x \forall y((x \neq y) \leftrightarrow \neg (... (view)
-
00:29Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I added \neq for inequality, \notin for non-membership, and \cong for equal cardinality (view)
-
00:17Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: If I add \neq do I also need to add an axiom \forall x \forall y((x \neq y) \leftrightarrow \neg (x=... (view)
16 September 2021
-
23:51P進大好きbot (talk | contribs) commented on the article User_blog:KarmaAnecdotes/Recursive Factory Function: Good approach, but it still includes minor errors. > I didn't directly say what each of the variable... (view)
-
22:53P進大好きbot (talk | contribs) commented on the article User_blog:Arcioko/arcioko's (me) repeat sequnce: Cool. If you want to define numbers, then it is good to try next to complete the definition, as a fi... (view)
-
22:49P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: OK. When you introduce new notions (including a large number, of course), then you clarify how the w... (view)
-
15:30Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: >Or am I misreading what you wrote? No, I had mistyped my axiom, as I meant it to mean extensionalit... (view)
-
14:43KarmaAnecdotes (talk | contribs) replied to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: Ok. I will do it in another post. So I can keep this post as reference material. (view)
-
13:24SzymonCreeperSC (talk | contribs) replied to the comment Why is s(3,3{2}2) equal to 27 using this program? It should solve to s(3,3,1,1,2) s(3,3,3,3) s(3... on the article Planetn9ne/San solver: True, this solver is incorrect s(3, 3, 2) = 3^^3 (3^3^3 (3^27 (7.625.597.484.987))) while gives 27 (view)
-
03:44P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > My intention for the change I made to Axiom of Separate Links was to clarify that a link which doe... (view)
-
03:40Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: My intention for the change I made to Axiom of Separate Links was to clarify that a link which doesn... (view)
-
03:11Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: My intention for the change I made to Axiom of Separate Links was to clarify that a link which doesn... (view)
-
01:50P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > Axiom of extensionality Is it really what you intend? It is still different from the usual one eve... (view)
15 September 2021
-
23:17ARsygo (talk | contribs) replied to the comment Neat but what was the logic behind the naming of your friend's number? It has the prefix octo in... on the article J200pd/Octodragondilliatillion: I assume that "octodragondilliat" is 165 2/3, actually. (view)
-
23:16ARsygo (talk | contribs) commented on the article User_blog:J200pd/Octodragondilliatillion: Also known as "googolding" or "gogolchime". (view)
-
16:22Kanrokoti (talk | contribs) replied to the comment THANK YOU!!!! I NOTICED THAT 三 function LOOKS SIMILAR TO Ξ function!!!! on the article Kanrokoti/Translation of 三 function: YW!!! PMPMPMPM!!!! (view)
-
16:20P進大好きbot (talk | contribs) commented on the article User_blog:Kanrokoti/Translation of 三 function: THANK YOU!!!! I NOTICED THAT 三 function LOOKS SIMILAR TO Ξ function!!!! (view)
-
16:10Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I also added three function symbols to my language and used one of them to shorten the Axiom of Infi... (view)
-
15:39Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The first three mistakes are fixed, but what notions should I define for Axiom of Link Existence to ... (view)
-
15:38Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: The first three mistakes should be fixed, but what notions should I define for Axiom of Link Existen... (view)
-
13:44P進大好きbot (talk | contribs) replied to the comment Well, this blog post sounds familiar to me, actually. on the article ANDY3556/Googology 101: Common Mistakes: In my opinion, cooking a salad number is not so serious as other mistakes. (view)
-
11:17ARsygo (talk | contribs) commented on the article User_blog:J200pd/Fortnite: How about PUBG, Call of Duty Warzone, etc.? (sorry, off-topic, but the blog post topic is actually s... (view)
-
11:15ARsygo (talk | contribs) commented on the article User_blog:ANDY3556/Googology 101: Common Mistakes: Well, this blog post sounds familiar to me, actually. (view)
-
05:36P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > Axiom of extensionality It still has the same error as I pointed out. > Axiom of link extensionali... (view)
-
04:49Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I rewrote the Axiom of Link Existence to Alternate Set of Links, so everything should be finished. (view)
14 September 2021
-
22:47ARsygo (talk | contribs) commented on the article User_blog:Pi.jayk/Hector: Chillor means 1000 pentated to 2, right? (view)
-
22:45ARsygo (talk | contribs) commented on the article User_blog:Rpakr/Destruction by GoogHAL-9000: Thankfully, it got reverted (sorry for the late reply) (view)
-
22:32ARsygo (talk | contribs) commented on the article User_blog:IIEnDeRwITHeRII/Googolo: I guess, despite errors, I think it's approximately {10,10,{10,100}}. (view)
-
14:27P進大好きbot (talk | contribs) replied to the comment Does the MOST considered ill-defined? on the article ArtismScrub/Analysis of MOST: To be fair, almost everybody in this community misunderstood three years ago what an ordinal notatio... (view)
-
14:23P進大好きbot (talk | contribs) replied to the comment Does the MOST considered ill-defined? on the article ArtismScrub/Analysis of MOST: > MOST, or Multiarrowed Ordinal Snowballing Train, is a simple ordinal notation Although I do not ch... (view)
-
13:48ARsygo (talk | contribs) commented on the article User_blog:ArtismScrub/Analysis of MOST: Does the MOST considered ill-defined? (view)
-
12:34P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: OK. I agree that it is generally difficult to rephrase a given description only by using other langu... (view)
-
12:30P進大好きbot (talk | contribs) replied to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: I note that a four-ary function is sufficiently difficult for the first trial. So, if you have in tr... (view)
-
11:52KarmaAnecdotes (talk | contribs) replied to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: Also, know that I am finally going to get around to trying to fix it, I am just going to write down ... (view)
-
11:12ARsygo (talk | contribs) commented on the article User_blog:MultiSoul/The X Hiearchy: It seems that there is an additional category named "Pages using invalid self-closed HTML tags". Wha... (view)
-
05:39Hypertetrakulus44 (talk | contribs) replied to the comment Actually you could add much more, eg milliak, trilliak, quadrilliak and so on, but I am not sure if ... on the article Hypertetrakulus44/My system of numbernames: N-ak = n^(n^2) (view)
-
04:03Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Many inequivalent statements were formed when I tried to express statements which originally used sy... (view)
-
04:01Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Many inequivalent statements were formed when I tried to express statements which originally used sy... (view)
-
04:00Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Many inequivalent statements were formed when I tried to express statements which originally used sy... (view)
-
03:54Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I will get around to fixing and clarifying these. (view)
-
03:19P進大好きbot (talk | contribs) replied to the comment Googology at its finest on the article P進大好きbot/CoFish number 7: Googology at its fishest (view)
-
03:07MultiSoul (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: Yes (view)
13 September 2021
-
22:34ARsygo (talk | contribs) replied to the comment Why did Apple reprogrammed Siri, so that it limited the factorial input to just 20? (thankfully I st... on the article Mopscrub/I found something interesting: Also, googolplex is nowhere near 94 million (9.4*10^7) digits, it's actually 10^100+1 digits, so 93 ... (view)
-
22:33ARsygo (talk | contribs) commented on the article User_blog:Mopscrub/I found something interesting: Why did Apple reprogrammed Siri, so that it limited the factorial input to just 20? (thankfully I st... (view)
-
22:31ARsygo (talk | contribs) commented on the article User_blog:BlauesWasser/Googology on youtube: Nowadays, you can find "NO!"'s channel on YouTube as well, actually. (view)
-
20:29SelfInvolution (talk | contribs) commented on the article User_blog:Literally Legendary/My opinion on the new Fandom feel: I like the new fandom feel. (view)
-
20:29SelfInvolution (talk | contribs) commented on the article User_blog:MultiSoul/A Multillion Prefixes!!!: If you can be using english number names, why use "oneundra" instead of "hundra"? (view)
-
19:07Literally Legendary (talk | contribs) commented on the article User_blog:P進大好きbot/CoFish number 7: Googology at its finest (view)
-
06:12ARsygo (talk | contribs) commented on the article User_blog:Rgetar/5189189189189184001 — Marouf's number: I never heard of that, actually. (view)
-
05:00P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Good. The axioms are quite well-written. > Axiom of extensionality Missing something after "z∈". >... (view)
12 September 2021
-
22:43Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I created a separate blog post to define my language, put a link to the Link Theory Axiom Language b... (view)
-
08:26P進大好きbot (talk | contribs) replied to the comment Hyp cos already developed an "R Function" that is much, much stronger than LVO. on the article B1mb0w/The R Function: But unfortunately, both R functions are ill-defined. (view)
-
07:57ARsygo (talk | contribs) replied to the comment Hyp cos already developed an "R Function" that is much, much stronger than LVO. on the article B1mb0w/The R Function: I hope that the name will be changed actually. (view)
11 September 2021
-
22:37ARsygo (talk | contribs) replied to the comment If you really want to write the actual value of MAGN for the day, it is better write the actual n... on the article MachineGunSuper/MachineGun's Arrow Growing Number: It looks like, on 5th March 2018, this number surpassed Graham's number, right? (view)
-
22:31P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Great! You have invented an actually well-defined formal language! Then the next step is to define a... (view)
-
22:30ARsygo (talk | contribs) replied to the comment on the article I am a McCree God/Tritriation: I'm sorry, but the picture above doesn't have any valid licensing. I actually marked that picture fo... (view)
-
22:25ARsygo (talk | contribs) replied to the comment If 3,301 up arrows, it means 3,303rd hyperoperation, right? on the article I am a McCree God/Milliatation: As 1,000th hyperoperation is just a binary function with 998 up arrows actually. (view)
-
22:25ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Milliatation: If 3,301 up arrows, it means 3,303rd hyperoperation, right? (view)
-
17:51Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: In this reply I will try to improve my formal definition and fix the many problems my original defin... (view)
-
16:57Literally Legendary (talk | contribs) commented on the article User_blog:Naruyoko/The Precise Value of D(99): That's amazing. (view)
-
14:05ARsygo (talk | contribs) replied to the comment This is exactly equal to 9* using SpongeTechX's mixed factorial. on the article I am a McCree God/Rising Operations Number: It is also known as "ennafact" as well, actually. (view)
-
13:56ARsygo (talk | contribs) replied to the comment In my system ωω[2] = ω2 as usual. You seem to have forgotten that in my notation, n is replaced b... on the article Nayuta Ito/A suggestion to the extension of Psi's Letter Notation: Well... we are now approaching Q, actually. (view)
-
09:10Spelpotatis (talk | contribs) commented on the article User_blog:Spelpotatis/LetCon notation: Yes, before you ask, i know this isn't a formal definition (view)
-
06:42P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > On the symbol ∈ I will assume all ZFC axioms, except instead the axiom of extension How do you a... (view)
-
04:30Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: What I have in my definition of Link Theory Axiom Language so far: The set of relation symbols conta... (view)
-
01:49Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: What I have in my definition of Link Theory Axiom Language so far: The set of relation symbols conta... (view)
-
01:45ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Another Name for Googolcentiplex: It's also known as "grangolplex". (view)
10 September 2021
-
11:55KarmaAnecdotes (talk | contribs) edited a reply to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: Okay, I see that I shouldn't immediately dive headfirst into functions that use ordinals. It seems l... (view)
-
11:54KarmaAnecdotes (talk | contribs) replied to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: Okay, I see that I shouldn't immediately dive headfirst into the ordinal functions. It seems like my... (view)
-
11:10ARsygo (talk | contribs) replied to the comment As strange as it may seem to you, this number is virtually indistinguishable from Graham's Number... on the article I am a McCree God/Facto-Graham: If "!!!!...!!!" treated as multifactorial, it's even smaller actually. (view)
-
11:06ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Latillion: Well... it's just fz-illion(3)... probably 10↑↑(10^3.6 × 109,000,000,000,003+1). (view)
-
08:01Spelpotatis (talk | contribs) commented on the article User_blog:Spelpotatis/STAN (Sples Terrible Array Notation): Looking back at this now, i realize just how bad this is (view)
-
07:53Spelpotatis (talk | contribs) commented on the article User_blog:Spelpotatis/New googologism: Plexobit: Note: this number is not based on the CURRENT amount of total storage exactly, as that would'nt be w... (view)
-
04:26P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: > Could you explain to me what a constant symbol is? Say, 0 in the laguage of PA is a constant term.... (view)
-
04:13Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Could you explain to me what a constant symbol is? Other than that, I don't use any functions in my ... (view)
-
03:29ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Illion (3): If !!..!! treated as a multifactorial, it will be much smaller, actually. (view)
-
03:13Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: From what I've read in https://en.wikipedia.org/wiki/First-order_logic#Formation_rules, here are my ... (view)
-
03:12P進大好きbot (talk | contribs) edited a reply to the comment "For example, we cannot compare BB(10^100) and the non-standard number N defined in an extension of ... on the article P進大好きbot/List of common mistakes in googology: There is no agreed-upon solution for the situation. But if we coin a number X defined by a formula F... (view)
-
03:11P進大好きbot (talk | contribs) replied to the comment "For example, we cannot compare BB(10^100) and the non-standard number N defined in an extension of ... on the article P進大好きbot/List of common mistakes in googology: There is no agreed-upon solution for the situation. But if we coin a number X defined by a formula F... (view)
-
03:09Literally Legendary (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: From what I've read in https://en.wikipedia.org/wiki/First-order_logic#Formation_rules, here are my ... (view)
-
03:02P進大好きbot (talk | contribs) edited a reply to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: > I have no idea. I never do googology using Chinese. I see. Xiexie. > But isn't it very easy to pro... (view)
-
03:01P進大好きbot (talk | contribs) edited a reply to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: > I have no idea. I never do googology using Chinese. I see. Xiexie. > But isn't it very easy to pro... (view)
-
03:00P進大好きbot (talk | contribs) replied to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: > I have no idea. I never do googology using Chinese. I see. Xiexie. > But isn't it very easy to pro... (view)
-
02:2112AbBa (talk | contribs) replied to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: But isn't it very easy to prove that 〈((1,Rayo+1)),n〉>Rayo when n≥1? (I refrain from using wor... (view)
-
02:1712AbBa (talk | contribs) replied to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: > is it correct that "array notation" is translated into "数阵记号"? I have no idea. I never do ... (view)
-
02:0112AbBa (talk | contribs) commented on the article User_blog:P進大好きbot/List of common mistakes in googology: "For example, we cannot compare BB(10^100) and the non-standard number N defined in an extension of ... (view)
-
00:53P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Good, but there are several misconceptions. ＞a predicate is the symbol A predicate is a formula, a... (view)
9 September 2021
-
23:54Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: From what I've read in https://en.wikipedia.org/wiki/First-order_logic#Formation_rules, a predicate ... (view)
-
22:54P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: OK. Then the fair starting point is to understand the full syntax (not only ∀, but alsothe use of ... (view)
-
22:49P進大好きbot (talk | contribs) replied to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: > For any positive integer x, and any infinite ordinal {\displaystyle \alpha }, {\displaystyle \alph... (view)
-
22:45Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I don't know a lot about first order logic except that it's different than propositional logic by ha... (view)
-
20:58KarmaAnecdotes (talk | contribs) edited a reply to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: >I hope that you will not feel bad. Usually, first trials have many errors. It's okay, I don't feel ... (view)
-
19:43KarmaAnecdotes (talk | contribs) edited a reply to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: >I hope that you will not feel bad. Usually, first trials have many errors. It's okay, I don't feel ... (view)
-
19:43KarmaAnecdotes (talk | contribs) edited a reply to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: >I hope that you will not feel bad. Usually, first trials have many errors. It's okay, I don't feel ... (view)
-
19:11KarmaAnecdotes (talk | contribs) replied to the comment Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... on the article KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: >I hope that you will not feel bad. Usually, first trials have many errors. It's okay, I don't feel ... (view)
-
14:30Kanrokoti (talk | contribs) replied to the comment > A partial set I think that a standard terminlogy is "subset". on the article Kanrokoti/Double-psi Function: I AM A REAL BEAR!!! KMKMKMKMKM!!!! (view)
-
14:00P進大好きbot (talk | contribs) replied to the comment > A partial set I think that a standard terminlogy is "subset". on the article Kanrokoti/Double-psi Function: WHAT'S "KMKMKM!!!"? IT SOUNDS LIKE A BEAR LAUGH!!! (view)
-
13:47Kanrokoti (talk | contribs) replied to the comment > A partial set I think that a standard terminlogy is "subset". on the article Kanrokoti/Double-psi Function: THANK YOU!! KMKMKMKM!!! (view)
-
12:15ARsygo (talk | contribs) replied to the comment Ah yes, in the preview, it says, "Double subscripts: use braces to clarify". What is that mean? on the article Edwin Shade/Can Chess Ordinals Produce Functions With Uncountable Growth Rates ?: Compared to the older versions, where it simply didn't bother to render if any of the LaTeX codes ha... (view)
-
12:14ARsygo (talk | contribs) replied to the comment Ah yes, in the preview, it says, "Double subscripts: use braces to clarify". What is that mean? on the article Edwin Shade/Can Chess Ordinals Produce Functions With Uncountable Growth Rates ?: Oh, I see... because, the newer versions of MathJax are able to tell what caused LaTeX to not render... (view)
-
11:08LemonTheTiel (talk | contribs) commented on the article User_blog:Sbiis Saibian/Addendum on New LNS: ExE is easy (view)
-
05:53P進大好きbot (talk | contribs) edited a reply to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: It is because this blog post had been written before Y-sequence was defined. (Only the idea was shar... (view)
-
05:52P進大好きbot (talk | contribs) edited a reply to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: It is because this blog post had been written before Y-sequence was defined. (Only the idea was shar... (view)
-
05:51P進大好きbot (talk | contribs) edited a reply to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: It is because this blog post had been written before Y-sequence was defined. (Only the idea was shar... (view)
-
05:48P進大好きbot (talk | contribs) replied to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: It is because this blog post had been written before Y-sequence was defined. (Only the idea was shar... (view)
-
05:39P進大好きbot (talk | contribs) replied to the comment Ah yes, in the preview, it says, "Double subscripts: use braces to clarify". What is that mean? on the article Edwin Shade/Can Chess Ordinals Produce Functions With Uncountable Growth Rates ?: In latex, sentences like "a_b_c" are not appropriately rendered. We need braces in order to distingu... (view)
-
05:34P進大好きbot (talk | contribs) edited a reply to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Well, my questions are not "what logic do you want use?" or "what syntax do you want to use?", but a... (view)
-
05:33P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Well, my questiona are not "what logic do you want use?" or "what syntax do you want to use?", but a... (view)
-
05:27P進大好きbot (talk | contribs) commented on the article User_blog:KarmaAnecdotes/KarmaAnecdotes's Recursive Factory Function: Oh, it looks very great. But it is ill-defined, by the following errors: 2.2 Lack of the Clarificati... (view)
-
04:40P進大好きbot (talk | contribs) commented on the article User_blog:RightLefts/Update: Great to hear that. (view)
-
04:22Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: I am considering a first order logic, and I want to use the syntax of the language defined in Rayo's... (view)
-
03:48B4423 (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: YOU ! (view)
-
01:48ARsygo (talk | contribs) commented on the article User_blog:Edwin Shade/Can Chess Ordinals Produce Functions With Uncountable Growth Rates ?: Ah yes, in the preview, it says, "Double subscripts: use braces to clarify". What is that mean? (view)
8 September 2021
-
23:29SelfInvolution (talk | contribs) commented on the article User_blog:Mumuji/New fandom look and feel opinion: I like it too (view)
-
14:4712AbBa (talk | contribs) replied to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: Also why do you say "is believed to be" for statements that are very simple to prove? Why don't you ... (view)
-
11:56ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/One Hundred Thousand: Also known as "lakh" as well. (view)
-
11:54ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Urasillion: This number actually comparable to "octalogue" actually. (view)
-
04:36Sbiis Saibian (talk | contribs) edited a reply to the comment So, what about the notation that you have made so far? on the article Sbiis Saibian/Addendum on New LNS: Polycell Notation and Hyper-E Notation (E#) are just two notations for the same polyadic function. T... (view)
-
04:10Sbiis Saibian (talk | contribs) replied to the comment So, what about the notation that you have made so far? on the article Sbiis Saibian/Addendum on New LNS: Polycell Notation and Hyper-E Notation (E#) are just two notations for the same polyadic function. T... (view)
-
03:24P進大好きbot (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: Could you tell me how much you know about formal logic? For example, do you know the syntax of a for... (view)
-
03:16ARsygo (talk | contribs) replied to the comment So, what about the notation that you have made so far? on the article Sbiis Saibian/Addendum on New LNS: So, what is the growth rate of the Poly-cell Notation? Is it higher or lower than notations from Ext... (view)
-
03:13Sbiis Saibian (talk | contribs) replied to the comment So, what about the notation that you have made so far? on the article Sbiis Saibian/Addendum on New LNS: I do actually plan to return to Extensible-E, however I have another notation, one I created before ... (view)
-
02:45Literally Legendary (talk | contribs) replied to the comment Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... on the article Literally Legendary/Theory of Links Axioms: How do I formally define such a language? (view)
-
02:14ARsygo (talk | contribs) replied to the comment So, what about the notation that you have made so far? on the article Sbiis Saibian/Addendum on New LNS: About Extensible-E and their numbers, actually. (view)
-
02:08Sbiis Saibian (talk | contribs) replied to the comment So, what about the notation that you have made so far? on the article Sbiis Saibian/Addendum on New LNS: Which one? And what about it? (view)
-
01:29ARsygo (talk | contribs) commented on the article User_blog:Sbiis Saibian/Addendum on New LNS: So, what about the notation that you have made so far? (view)
-
01:03P進大好きbot (talk | contribs) replied to the comment Are you sure that (1,2,4,8,10,8) terminates? on the article P進大好きbot/New Difference Sequence System: No. (To be more precise, I am not sure that lower terms are terminating.) I note that the terminatio... (view)
-
00:40P進大好きbot (talk | contribs) commented on the article User_blog:Literally Legendary/Theory of Links Axioms: Cool trial, but it is not fully formalised, as the language is undefined. It should be defined befor... (view)
-
00:3212AbBa (talk | contribs) commented on the article User_blog:P進大好きbot/New Difference Sequence System: Are you sure that (1,2,4,8,10,8) terminates? (view)
7 September 2021
-
22:52P進大好きbot (talk | contribs) commented on the article User_blog:Sbiis Saibian/An Announcement on LNS Classic: Cool design! But I am sorry to point out that the history page includes outdated informations. BIIG ... (view)
-
21:52Andrewtheredditor (talk | contribs) commented on the article User_blog:Sbiis Saibian/An Announcement on LNS Classic: You and the Numberphile video on G64 are the reasons I went into googology. (view)
-
21:36Sbiis Saibian (talk | contribs) replied to the comment I hope as many people as possible for years to come will get the amazing experience of reading your ... on the article Sbiis Saibian/An Announcement on LNS Classic: Thank you (view)
-
12:02P進大好きbot (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Great. Then after learning Ackerman function or other elementary recursive functions, it is good to ... (view)
-
11:45KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Ok, I already know up-arrow notation, chained arrow notation, and a lot of functions that are based ... (view)
-
11:11ARsygo (talk | contribs) replied to the comment No, 10^^5<<<EE((E10)^^10). Note: I use brackets as in, E[9]99=9^99. on the article ARsygo/Logue series and extensions: Oops, sorry about that, I didn't realize that. (view)
-
11:08ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Illion: So, the -illion version of this number is 10^(3*10^(6 × 10^9,000,000,000,000)+3), right? (view)
-
04:26P進大好きbot (talk | contribs) commented on the article User_blog:Kanrokoti/Double-psi Function: > A partial set I think that a standard terminlogy is "subset". (view)
-
04:25P進大好きbot (talk | contribs) edited a reply to the comment Such an approach frequently includes many common failures. Are you certain that you are not making t... on the article Literally Legendary/New Function Coming Soon...: I see, Then I recommend to check the list when you write (portion of) the definition, because many p... (view)
-
03:42P進大好きbot (talk | contribs) replied to the comment Such an approach frequently includes many common failures. Are you certain that you are not making t... on the article Literally Legendary/New Function Coming Soon...: I see, Then I recommend to check the list when you wrote something, because many people have made th... (view)
-
03:37Literally Legendary (talk | contribs) edited a reply to the comment Such an approach frequently includes many common failures. Are you certain that you are not making t... on the article Literally Legendary/New Function Coming Soon...: I'm writing the axioms in symbolic form, like ∀x∀y(∀z(z∈x⇔z∈y)⇒x=y) but my axioms are ... (view)
-
03:35Literally Legendary (talk | contribs) replied to the comment Such an approach frequently includes many common failures. Are you certain that you are not making t... on the article Literally Legendary/New Function Coming Soon...: I'm writing the axioms in symbolic form, like ∀x∀y(∀z(z∈x⇔z∈y)⇒x=y) (view)
-
03:18Literally Legendary (talk | contribs) replied to the comment Such an approach frequently includes many common failures. Are you certain that you are not making t... on the article Literally Legendary/New Function Coming Soon...: I don't know. Nothing is finished yet. (view)
-
03:01P進大好きbot (talk | contribs) replied to the comment > So my New Lower Bound for TREE(3) is 34 which will be perhaps the Lowest Lower Bound for TREE(3). ... on the article DAno80/New Lower Bound for TREE(3)?: Right. Even -TREE(3) is a lower bound. (view)
-
01:50ARsygo (talk | contribs) replied to the comment Also known in our neck of the woods as "a googolchime" on the article I am a McCree God/Ten Trecendotrigintillion: Or "guppybell", as well., or even "gargoogolding". (view)
-
01:37P進大好きbot (talk | contribs) commented on the article User_blog:Literally Legendary/New Function Coming Soon...: Such an approach frequently includes many common failures. Are you certain that you are not making t... (view)
6 September 2021
-
23:36SelfInvolution (talk | contribs) edited a reply to the comment > So my New Lower Bound for TREE(3) is 34 which will be perhaps the Lowest Lower Bound for TREE(3). ... on the article DAno80/New Lower Bound for TREE(3)?: Anything provable to be less than actual value of TREE(3) is a lower bound (view)
-
23:36SelfInvolution (talk | contribs) replied to the comment > So my New Lower Bound for TREE(3) is 34 which will be perhaps the Lowest Lower Bound for TREE(3). ... on the article DAno80/New Lower Bound for TREE(3)?: Anything provable to less than actual value of TREE(3) is a lower bound (view)
-
13:11ARsygo (talk | contribs) replied to the comment The third step is actually much easier than the second, because the approximations get easier as... on the article Unknown95387/Help please: How does "Graham's number" approximate in terms of -ag? (view)
-
13:03ARsygo (talk | contribs) commented on the article User_blog:Edwin Shade/A Googologist's Rhapsody: I'll just wait for "large number garden number" to show up here. (view)
-
09:57P進大好きbot (talk | contribs) replied to the comment That can have a growth rate of w^w. on the article Arcioko/refactorial: Oh... Could you explain your analysis...? (view)
-
07:41SelfInvolution (talk | contribs) commented on the article User_blog:Arcioko/refactorial: That can have a growth rate of w^w. (view)
-
01:47ARsygo (talk | contribs) replied to the comment I hope that Saibian extends the notation, so that we can compare it with this notation. on the article Bubby3/Linear Array Extended-Cascading-E notation.: Update: I noticed on the new notice, he said that he will complete Chapter 4 once the his new Sites ... (view)
5 September 2021
-
15:57DAno80 (talk | contribs) replied to the comment > So my New Lower Bound for TREE(3) is 34 which will be perhaps the Lowest Lower Bound for TREE(3). ... on the article DAno80/New Lower Bound for TREE(3)?: I did not know TREE(1) was considered a Lower Bound (view)
-
10:27ARsygo (talk | contribs) replied to the comment Why is it called a Rawrillion ? on the article I am a McCree God/Rawrillion: To be the real -illion, it must be 10^(3n+3) actually. (view)
-
09:46ARsygo (talk | contribs) replied to the comment There is now another similar calculator made by another user. It has been designed to handle both... on the article Username5243/A UNAN calculator thingy: I and O don't exist in the Letter Notation, actually. (view)
-
05:52SelfInvolution (talk | contribs) edited a comment on the article User_blog:MultiSoul/trying to hold the world record for most googolosms invented: If you are trying to coin the most numbers, then the greek letter is bad idea because it is only 24 ... (view)
-
05:52SelfInvolution (talk | contribs) edited a comment on the article User_blog:MultiSoul/trying to hold the world record for most googolosms invented: If you are trying to the most numbers, then the greek letter is bad idea because it is only 24 of th... (view)
-
05:52SelfInvolution (talk | contribs) commented on the article User_blog:MultiSoul/trying to hold the world record for most googolosms invented: If you are trying to the most numbers, then greek letter is bad idea because there are only 24 (view)
-
04:21P進大好きbot (talk | contribs) commented on the article User_blog:DAno80/New Lower Bound for TREE(3)?: > So my New Lower Bound for TREE(3) is 34 which will be perhaps the Lowest Lower Bound for TREE(3). ... (view)
-
03:51SelfInvolution (talk | contribs) commented on the article User_blog:Literally Legendary/Rocket function: You must specify domain of this function as nonnegative integer (view)
-
03:48SelfInvolution (talk | contribs) edited a comment on the article User_blog:DAno80/New Lower Bound for TREE(3)?: This is so weak lower bound, it useless to have weak lower bound when we can produce strong lower bo... (view)
-
03:48SelfInvolution (talk | contribs) commented on the article User_blog:DAno80/New Lower Bound for TREE(3)?: This is so weak lower bound, it useless to have weak lower biund when we can produce strong lower bo... (view)
-
02:18P進大好きbot (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: I see. Please feel free to come back to this topic, because set theory is open for everyone. (Set th... (view)
-
01:49ARsygo (talk | contribs) commented on the article User_blog:Edwin Shade/The Timeline Function: Well... it looks like it's time to delete this post, actually. (view)
-
00:35KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >What do you mean? -Nothing, I had just lost count. >>Now, as I have spent a lot of time on formaliz... (view)
-
00:33KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >What do you mean? -Nothing, I had just lost count. >>Now, as I have spent a lot of time on formaliz... (view)
-
00:26KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >What do you mean? -Nothing, I had just lost count. >>Now, as I have spent a lot of time on formaliz... (view)
-
00:25KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >What do you mean? -Nothing, I had just lost count. >>Now, as I have spent a lot of time on formaliz... (view)
4 September 2021
-
22:48P進大好きbot (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >“From axiom 0, the set Y = {\displaystyle \lbrace x\in E|Q(x)\rbrace }.” This is a statement, a... (view)
-
21:54Literally Legendary (talk | contribs) commented on the article User_blog:Sbiis Saibian/An Announcement on LNS Classic: I hope as many people as possible for years to come will get the amazing experience of reading your ... (view)
-
16:03KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >By the way, could you explain what a "property" means? -I think property might be one of the those ... (view)
-
14:03ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/100!^99!^98!^...^1!: It's larger than 100!1, but less than giggol. (view)
-
13:47ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Ten Tremilliamilliamilliam...trecentretriginmilliamilliatrecentretriginmilliatrecenduotrigintillion: If using Bowers' -illions... approximately 10 duotrigintitriaoctocontehexahectillion. (view)
-
11:14ARsygo (talk | contribs) commented on the article User_blog:Edwin Shade/A Number Naming System Perhaps Beyond Saibian or Bower's !: Does it mean that this post needs to be deleted? (view)
-
11:13ARsygo (talk | contribs) commented on the article User_blog:ArtismScrub/Further extension to Cookiefonster's extended corporal numbers: Any higher entry linear array notation level ideas? (view)
-
05:48EricABQ (talk | contribs) edited a reply to the comment I may as well mention here that plans for my large number site are extremely up in the air. The whol... on the article Sbiis Saibian/An Announcement on LNS Classic: That sounds cool! Personally, I would like to see the large numbers list expanded with more entries ... (view)
-
05:47EricABQ (talk | contribs) replied to the comment I may as well mention here that plans for my large number site are extremely up in the air. The whol... on the article Sbiis Saibian/An Announcement on LNS Classic: That sounds cool! Personally, I would like to see the large numbers list expanded with more entries ... (view)
-
05:21Cloudy176 (talk | contribs) replied to the comment I'm trying to move my googology site onto GitHub Pages. googology-site | My googology site, original... on the article Sbiis Saibian/An Announcement on LNS Classic: Yes. (view)
-
05:08MultiSoul (talk | contribs) replied to the comment You might be interested in my list of Conway's -illion numbers and the modified version which is reg... on the article MultiSoul/My List Of Illion Numbers!!!: E (view)
-
01:13P進大好きbot (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: > I will fix that typo, also with the undefined p, it was supposed to be a property, that is my bad,... (view)
-
00:06ARsygo (talk | contribs) replied to the comment I'm trying to move my googology site onto GitHub Pages. googology-site | My googology site, original... on the article Sbiis Saibian/An Announcement on LNS Classic: So, you need to move all of your contents into the new GitHub page, right? (view)
3 September 2021
-
17:19KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Axiom of Power sets: With this axiom, you can prove that, for any set x, there exists a set P(x) suc... (view)
-
17:18KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Axiom of Power sets: With this axiom, you can prove that, for any set x, there exists a set P(x) suc... (view)
-
17:15KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
17:14KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
17:02KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
16:07Cloudy176 (talk | contribs) commented on the article User_blog:Sbiis Saibian/An Announcement on LNS Classic: I'm trying to move my googology site onto GitHub Pages. googology-site | My googology site, original... (view)
-
15:53KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Axiom of Subsets: With this axiom, we can prove that for any set A and for any property p, there is ... (view)
-
15:53KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
15:52KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Axiom of Subsets: With this axiom, we can prove that for any set A and for any property p, there is ... (view)
-
15:35KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
15:29KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
15:28KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >But you were working in three axioms, and hence were not assuming full ZFC. If you use all notions ... (view)
-
14:55P進大好きbot (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: > I thought that if I worked in ZFC set theory then the notion of a function could be assumed. But y... (view)
-
13:55ARsygo (talk | contribs) commented on the article User_blog:Edwin Shade/You Know You're a Googologist When...: You understand large -illions and other notations to extend more -illions as well. (view)
-
13:53ARsygo (talk | contribs) commented on the article User_blog:Edwin Shade/A Revised Fast-Growing Hierarchy and Extended Copy Notation: Wow, it looks like, I couldn't see what it is inside actually. (view)
-
13:22KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Axiom of Subsets: With this axiom, we can prove that for any set A, there is a set B such that, for ... (view)
-
13:22KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >Right. Since ∅ is ill-defined when you only assume the axiom of emptyset, it should not be introd... (view)
-
13:21KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Axiom of Subsets: With this axiom, we can prove that for any set A, there is a set B such that, for ... (view)
-
12:39KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >Right. Since ∅ is ill-defined when you only assume the axiom of emptyset, it should not be introd... (view)
-
12:34KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >Right. Since ∅ is ill-defined when you only assume the axiom of emptyset, it should not be introd... (view)
-
11:57KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >Right. Since ∅ is ill-defined when you only assume the axiom of emptyset, it should not be introd... (view)
-
11:53KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >Right. Since ∅ is ill-defined when you only assume the axiom of emptyset, it should not be introd... (view)
-
11:50KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >Right. Since ∅ is ill-defined when you only assume the axiom of emptyset, it should not be introd... (view)
-
10:43ARsygo (talk | contribs) commented on the article User_blog:ArtismScrub/False Giaxul: So, "false giaxul" is approximately 200 ducentated to faxul, right? (view)
-
10:42ARsygo (talk | contribs) commented on the article User_blog:I am a McCree God/Ninionflyunio: So, it is equal to 9!1 in expofactorial, actually. (view)
-
02:12Sbiis Saibian (talk | contribs) replied to the comment Note: Denis Maksudov's site used to have a Classic Sites, but now the site has been changed to the n... on the article Sbiis Saibian/An Announcement on LNS Classic: I actually archived quite a few new sites before realizing that they were "new". The list I compiled... (view)
-
00:55ARsygo (talk | contribs) commented on the article User_blog:Sbiis Saibian/An Announcement on LNS Classic: Note: Denis Maksudov's site used to have a Classic Sites, but now the site has been changed to the n... (view)
2 September 2021
-
22:47P進大好きbot (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: > Would it be better to introduce the symbol at the axiom of extensionality, the axiom that says th... (view)
-
21:11KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >nyway, have you read my comment "Do you think that it is well-defined (i.e. uniquely characterized ... (view)
-
20:55Cookiefonster (talk | contribs) edited a reply to the comment I may as well mention here that plans for my large number site are extremely up in the air. The whol... on the article Sbiis Saibian/An Announcement on LNS Classic: I'll be sure to! I've archived the HTML code of all my site's pages as well. (view)
-
20:55Cookiefonster (talk | contribs) replied to the comment I may as well mention here that plans for my large number site are extremely up in the air. The whol... on the article Sbiis Saibian/An Announcement on LNS Classic: I'll be sure to! (view)
-
20:51Sbiis Saibian (talk | contribs) replied to the comment I may as well mention here that plans for my large number site are extremely up in the air. The whol... on the article Sbiis Saibian/An Announcement on LNS Classic: I don't think I got around to mentioning this but I archived a copy of your classic site for my own ... (view)
-
20:46Cookiefonster (talk | contribs) commented on the article User_blog:Sbiis Saibian/An Announcement on LNS Classic: I may as well mention here that plans for my large number site are extremely up in the air. The whol... (view)
-
19:05KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >nyway, have you read my comment "Do you think that it is well-defined (i.e. uniquely characterized ... (view)
-
19:02KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >nyway, have you read my comment "Do you think that it is well-defined (i.e. uniquely characterized ... (view)
-
18:38KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >nyway, have you read my comment "Do you think that it is well-defined (i.e. uniquely characterized ... (view)
-
18:37KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: >nyway, have you read my comment "Do you think that it is well-defined (i.e. uniquely characterized ... (view)
-
18:23KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: > Axiom of empty set: I don't think you could necessarily prove anything with it, BUT it is absolute... (view)
-
18:23KarmaAnecdotes (talk | contribs) edited a reply to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Ok, (view)
-
18:19KarmaAnecdotes (talk | contribs) replied to the comment The first 3 axioms: -I did some studying on the first three axioms first(I did these three at once b... on the article KarmaAnecdotes/Attempt VII: Ok, in that case, hold on I am going to try something before I post the thing. (view)
-
17:06Cloudy176 (talk | contribs) replied to the comment Sbiis already archived his website and "and at least 31 other sites". on the article SelfInvolution/Classic google sites: I already archived them. (view)
-
03:42SelfInvolution (talk | contribs) edited a reply to the comment Sbiis already archived his website and "and at least 31 other sites". on the article SelfInvolution/Classic google sites: I'm talking about the not maintained websites like username5243's website, numberwikipedia website, ... (view)
-
03:42SelfInvolution (talk | contribs) edited a reply to the comment Sbiis already archived his website and "and at least 31 other sites". on the article SelfInvolution/Classic google sites: I'm talking about the not maintained websites like username5243's website, numberwikipedia website, ... (view)
-
03:42