Talk:1277: Ayn Random - Revision history

172.70.90.154: Meant to say. The reason I mentioned it.

2023-06-21T10:45:05Z

Meant to say. The reason I mentioned it.

172.70.162.51 at 10:28, 21 June 2023

2023-06-21T10:28:23Z

141.101.99.157 at 10:22, 21 June 2023

2023-06-21T10:22:39Z

Nitpicking: 9 years later, I arrive. Where's everyone?

2023-06-21T03:35:44Z

9 years later, I arrive. Where's everyone?

172.70.114.43 at 13:32, 8 June 2022

2022-06-08T13:32:21Z

172.70.114.43 at 13:31, 8 June 2022

2022-06-08T13:31:45Z

172.70.114.43 at 13:31, 8 June 2022

2022-06-08T13:31:04Z

MigB: Pun detected

2022-06-08T07:22:12Z

Pun detected

172.68.142.227 at 07:55, 26 February 2017

2017-02-26T07:55:06Z

108.162.237.89 at 22:14, 1 November 2016

2016-11-01T22:14:22Z

@@ Line 92: / Line 92: @@
 :The ()s [probably what you meant] are a grouping-method, often used to internally or externally take note of any sub-match (or sub-sub-match, because you can nest them!) to make explicit use of them elsewhere. But here it acts to define the "thing" that the {}s refer to, to make it unnecessary to write it out again (and with a differently contrived flexibility of repetition). There are also various (?...) things to do with ()s, which are occasionally useful.
 :The {}s ([which you might also have been refering to, but I doubt it]) is described in the article but is commonly used to say "rematch the thing we just had a specific number of times". With "W{3,6}", it would need from three to six 'W's, "X{,6}" is anything up to six 'X's (not all implementations offer this, there are various other ways to define "no more than # times (and possibly zero)", if you need that), "Y{3,}" means at least three 'Y's and "Z{5}" is exactly that many. Combined with ()s, "(WXYZ){2}" means "WXYZWXYZ", combined with []s, "[WXYZ]{2}" means "WW", "WX", "WY", "WZ", "XW", "XX", ..., "ZY" ''or'' "ZZ". (There can also be the use of them in things like "\b{wb}", but that's different. And may not exist in all implementations.)
-:Using ()s and []s but (instead of {}s) using the a call-back to what was already matched, e.g. "([WXYZ])\1", requires a repeat to match the first match result (not just to be a new attempt to match any of the matchable elements). It would match "WW", "XX", "YY" and "ZZ" only.
+:Using ()s and []s but (instead of {}s) using the a call-back to what was already matched, e.g. "([WXYZ])\1", requires a repeat to match the first match result (not just to be a new attempt to match any of the matchable elements). It would match "WW", "XX", "YY" and "ZZ" only. Using \1 instead of {2} in the comic's statement would not match plain "Duran Duran" (because the first match would be "Duran ", with the space, the second could only ever find "Duran") unless it was "...Duran Duran ''and something else...''".
 :...Randall doesn't invoke much of that, actually. But if you're interested enough to want to know, far be it for me to deny you the information! ;)
 :'''TL;DR;''' - work your way through something like [https://perldoc.perl.org/perlre this, for Perl], [https://docs.python.org/3/library/re.html this for Python] or whatever treatment matches any other language/script-dialect you think you might be interested in using that could have inbuilt regexp notation/function to it. [[Special:Contributions/141.101.99.157|141.101.99.157]] 10:22, 21 June 2023 (UTC)

@@ Line 90: / Line 90: @@
 :\b isn't a 'word', it's a word boundary. The otherwise unmarked null-space between any word-character (usually defined as <code>[A-Za-z0-9_]</code>, but more on that later) and either a non-word character or either end of the full string. For something like "This 1st-Class example", it should also match with any/all the '''\b'''s in "'''\b'''This'''\b''' '''\b'''1st'''\b'''-'''\b'''Class'''\b''' '''\b'''example'''\b'''".
 :The []s (if you're asking about them) groups characters together as an "it's one of these" element. A few particular characters that mean something special... the "-" in [a-z] means all characters from "a" to "z", or [4-6] would be 4, 5 or 6. An initial "^" means everything ''except'' the following provided group, and "\" meta-escapes anything that needs to be, so you could get "-" explicitly by "\-", or specify any of the whitespace class by "\s". But otherwise (and for the comic) it's just a list of characters. Case-sensitive unless the regexp (or a subset of it) is otherwise called with ignore-case instructions.
-:The ()s [probably what you meant] are a grouping-method, often used to internally or externally take note of any sub-match (or sub-sub-match, because you can nest them!) to make explicit use of them elsewhere. But here it acts to define the "thing" that the {}s refer to, to make it unnecessary to write it out again (and with a differently contrived flexibility of repetition). There are also various (?...) things to do with ()s, which are oc asiinally useful.
+:The ()s [probably what you meant] are a grouping-method, often used to internally or externally take note of any sub-match (or sub-sub-match, because you can nest them!) to make explicit use of them elsewhere. But here it acts to define the "thing" that the {}s refer to, to make it unnecessary to write it out again (and with a differently contrived flexibility of repetition). There are also various (?...) things to do with ()s, which are occasionally useful.
-:The {}s ([which you might also have been refering to, but I doubt it]) is described in the article but is commonly used to say "rematch the thing we just had a specific number of times". With "W{3,6}", it would need from three to six 'W's, "X{,6}" is anything up to six 'X's (not all implementations offer this, there are), "Y{3,}" means at least three 'Y's and "Z{5}" is exactly that many. Combined with ()s, "(WXYZ){2}" means "WXYZWXYZ", combined with []s, "[WXYZ]{2}" means "WW", "WX", "WY", "WZ", "XW", "XX", ..., "ZY" ''or'' "ZZ". (There can also be the use of them in things like "\b{wb}", but that's different. And may not exist in all implementations.)
+:The {}s ([which you might also have been refering to, but I doubt it]) is described in the article but is commonly used to say "rematch the thing we just had a specific number of times". With "W{3,6}", it would need from three to six 'W's, "X{,6}" is anything up to six 'X's (not all implementations offer this, there are various other ways to define "no more than # times (and possibly zero)", if you need that), "Y{3,}" means at least three 'Y's and "Z{5}" is exactly that many. Combined with ()s, "(WXYZ){2}" means "WXYZWXYZ", combined with []s, "[WXYZ]{2}" means "WW", "WX", "WY", "WZ", "XW", "XX", ..., "ZY" ''or'' "ZZ". (There can also be the use of them in things like "\b{wb}", but that's different. And may not exist in all implementations.)
 :Using ()s and []s but (instead of {}s) using the a call-back to what was already matched, e.g. "([WXYZ])\1", requires a repeat to match the first match result (not just to be a new attempt to match any of the matchable elements). It would match "WW", "XX", "YY" and "ZZ" only.
 :...Randall doesn't invoke much of that, actually. But if you're interested enough to want to know, far be it for me to deny you the information! ;)
 :'''TL;DR;''' - work your way through something like [https://perldoc.perl.org/perlre this, for Perl], [https://docs.python.org/3/library/re.html this for Python] or whatever treatment matches any other language/script-dialect you think you might be interested in using that could have inbuilt regexp notation/function to it. [[Special:Contributions/141.101.99.157|141.101.99.157]] 10:22, 21 June 2023 (UTC)

← Older revision		Revision as of 10:22, 21 June 2023
Line 88:		Line 88:

	The explanation of the regular expression doesn't explain what the parentheses do, if it's the \b that signifies "word". [[User:Nitpicking\|Nitpicking]] ([[User talk:Nitpicking\|talk]]) 03:35, 21 June 2023 (UTC)		The explanation of the regular expression doesn't explain what the parentheses do, if it's the \b that signifies "word". [[User:Nitpicking\|Nitpicking]] ([[User talk:Nitpicking\|talk]]) 03:35, 21 June 2023 (UTC)
		+	:\b isn't a 'word', it's a word boundary. The otherwise unmarked null-space between any word-character (usually defined as <code>[A-Za-z0-9_]</code>, but more on that later) and either a non-word character or either end of the full string. For something like "This 1st-Class example", it should also match with any/all the '''\b'''s in "'''\b'''This'''\b''' '''\b'''1st'''\b'''-'''\b'''Class'''\b''' '''\b'''example'''\b'''".
		+	:The []s (if you're asking about them) groups characters together as an "it's one of these" element. A few particular characters that mean something special... the "-" in [a-z] means all characters from "a" to "z", or [4-6] would be 4, 5 or 6. An initial "^" means everything ''except'' the following provided group, and "\" meta-escapes anything that needs to be, so you could get "-" explicitly by "\-", or specify any of the whitespace class by "\s". But otherwise (and for the comic) it's just a list of characters. Case-sensitive unless the regexp (or a subset of it) is otherwise called with ignore-case instructions.
		+	:The ()s [probably what you meant] are a grouping-method, often used to internally or externally take note of any sub-match (or sub-sub-match, because you can nest them!) to make explicit use of them elsewhere. But here it acts to define the "thing" that the {}s refer to, to make it unnecessary to write it out again (and with a differently contrived flexibility of repetition). There are also various (?...) things to do with ()s, which are oc asiinally useful.
		+	:The {}s ([which you might also have been refering to, but I doubt it]) is described in the article but is commonly used to say "rematch the thing we just had a specific number of times". With "W{3,6}", it would need from three to six 'W's, "X{,6}" is anything up to six 'X's (not all implementations offer this, there are), "Y{3,}" means at least three 'Y's and "Z{5}" is exactly that many. Combined with ()s, "(WXYZ){2}" means "WXYZWXYZ", combined with []s, "[WXYZ]{2}" means "WW", "WX", "WY", "WZ", "XW", "XX", ..., "ZY" ''or'' "ZZ". (There can also be the use of them in things like "\b{wb}", but that's different. And may not exist in all implementations.)
		+	:Using ()s and []s but (instead of {}s) using the a call-back to what was already matched, e.g. "([WXYZ])\1", requires a repeat to match the first match result (not just to be a new attempt to match any of the matchable elements). It would match "WW", "XX", "YY" and "ZZ" only.
		+	:...Randall doesn't invoke much of that, actually. But if you're interested enough to want to know, far be it for me to deny you the information! ;)
		+	:'''TL;DR;''' - work your way through something like [https://perldoc.perl.org/perlre this, for Perl], [https://docs.python.org/3/library/re.html this for Python] or whatever treatment matches any other language/script-dialect you think you might be interested in using that could have inbuilt regexp notation/function to it. [[Special:Contributions/141.101.99.157\|141.101.99.157]] 10:22, 21 June 2023 (UTC)

@@ Line 56: / Line 56: @@
 From above: "Objectivism is the target for much scorn and ridicule in the intellectual world, for its being an inconsistent philosophy that has the sole objective of justifying selfishness and elevating it towards moral righteousness. It's used as the basis for libertarian thought and other radical capitalist economical theories and political stances which promote shameless exploitation (and this attracts further hatred). Randall is no exception to this trend of detractors, and I'd say rightfully so. Ayn Rand's writings are particularly awful, both aesthetically and content-wise, yet in the US a relatively large group of philosophers still adhere to her maxims and the debate continues." OK, but a few comments: All philosophies are inconsistent when looked at closely enough, refer Godel and others. Others do not see the inconsistency in Objectivism quite so plainly as in the quoted comment. Ayn Rand and Objectivism are not "the" basis of libertarian thought, there are far more highly thought of libertarian thinkers, a list of whom should come readily to mind to any of those occupying "the intellectual world" (sic), whether or not they have sympathy with libertarian ideas. It is also unfair to characterise Objectivism as having as its "sole" objective that as stated. Further, as a general principle, one ought not to take someone poking fun at a concept as *proof* that they are quite as opposed to it as you are. Now, whereas I would not categorise myself quite as a fellow traveller, a much fairer view of Objectivism is found at WP: http://en.wikipedia.org/wiki/Objectivism_(Ayn_Rand) [[Special:Contributions/81.135.136.159|81.135.136.159]] 11:22, 16 October 2013 (UTC)
 :Other philosophies are no more consistent, agreed. But other philosophies do not claim perfect "objective" consistency as their fundamental principle. Attacking Objectivism/Objectivists for lack of internal consistency--or for not recognizing that at some, very fundamental, level it is all stacked on top of some assumptions (just like every other philosophy, and even the scientific method)--is the equivalent of attacking Christianity/Christians for lacking compassion and forgiveness. [[Special:Contributions/129.176.151.14|129.176.151.14]] 14:04, 16 October 2013 (UTC)
@@ Line 84: / Line 86: @@
 So nobody noticed how "this ain't random" seems to be the first thing Cueball says? I think the pun "this Ayn/ain't random" is a big part of the joke. [[User:MigB|MigB]] ([[User talk:MigB|talk]]) 07:22, 8 June 2022 (UTC)
 :doesnt add up, sorry. ayn rand's first name is pronounced "ine" (/aɪn/), according to an ipa note on her page on wikipedia. the main part of the joke is that objectivism (ayn rand's main philosophy) claims to distribute resources fairly but does not, hence an "ayn random" number generator claims to distribute probability fairly but does not --[[Special:Contributions/172.70.114.43|172.70.114.43]] 13:31, 8 June 2022 (UTC)

← Older revision		Revision as of 13:32, 8 June 2022
Line 83:		Line 83:

	So nobody noticed how "this ain't random" seems to be the first thing Cueball says? I think the pun "this Ayn/ain't random" is a big part of the joke. [[User:MigB\|MigB]] ([[User talk:MigB\|talk]]) 07:22, 8 June 2022 (UTC)		So nobody noticed how "this ain't random" seems to be the first thing Cueball says? I think the pun "this Ayn/ain't random" is a big part of the joke. [[User:MigB\|MigB]] ([[User talk:MigB\|talk]]) 07:22, 8 June 2022 (UTC)
−	:doesnt add up, sorry. ayn rand's first name is pronounced "ine" (/aɪn/), according to an ipa note on her page on wikipedia. ~~there~~ is ~~a pun in~~ that objectivism (ayn rand's main philosophy) claims to distribute resources fairly but does not, hence an "ayn random" number generator claims to distribute probability fairly but does not --[[Special:Contributions/172.70.114.43\|172.70.114.43]] 13:31, 8 June 2022 (UTC)	+	:doesnt add up, sorry. ayn rand's first name is pronounced "ine" (/aɪn/), according to an ipa note on her page on wikipedia. the main part of the joke is that objectivism (ayn rand's main philosophy) claims to distribute resources fairly but does not, hence an "ayn random" number generator claims to distribute probability fairly but does not --[[Special:Contributions/172.70.114.43\|172.70.114.43]] 13:31, 8 June 2022 (UTC)

← Older revision		Revision as of 13:31, 8 June 2022
Line 83:		Line 83:

	So nobody noticed how "this ain't random" seems to be the first thing Cueball says? I think the pun "this Ayn/ain't random" is a big part of the joke. [[User:MigB\|MigB]] ([[User talk:MigB\|talk]]) 07:22, 8 June 2022 (UTC)		So nobody noticed how "this ain't random" seems to be the first thing Cueball says? I think the pun "this Ayn/ain't random" is a big part of the joke. [[User:MigB\|MigB]] ([[User talk:MigB\|talk]]) 07:22, 8 June 2022 (UTC)
−	:doesnt add up, sorry. ayn rand's first name is pronounced "ine", according to an ipa note on her page on wikipedia. there is a pun in that objectivism (ayn rand's main philosophy) claims to distribute resources fairly but does not, hence an "ayn random" number generator claims to distribute probability fairly but does not --[[Special:Contributions/172.70.114.43\|172.70.114.43]] 13:31, 8 June 2022 (UTC)	+	:doesnt add up, sorry. ayn rand's first name is pronounced "ine" (/aɪn/), according to an ipa note on her page on wikipedia. there is a pun in that objectivism (ayn rand's main philosophy) claims to distribute resources fairly but does not, hence an "ayn random" number generator claims to distribute probability fairly but does not --[[Special:Contributions/172.70.114.43\|172.70.114.43]] 13:31, 8 June 2022 (UTC)

← Older revision		Revision as of 07:22, 8 June 2022
Line 81:		Line 81:
	Computers don't store any "thing", they store a representation. Therefore, a computer can reference any "thing", because representation "sets" can be swapped out. At any given moment, if the user is aware, "1" could mean a purple flying dog. At any other given moment, "1" could mean a swimming cactus. Therefore, the number of "things" that computers can store representations for is unlimited, even if the "set" of representations it can store at any given time is limited. In our specific example, the computer can store a representation of an irrational number by collapsing the number into a recursive or incremental method of reproducing the number. [[Special:Contributions/108.162.216.114\|108.162.216.114]] 20:07, 10 December 2014 (UTC)		Computers don't store any "thing", they store a representation. Therefore, a computer can reference any "thing", because representation "sets" can be swapped out. At any given moment, if the user is aware, "1" could mean a purple flying dog. At any other given moment, "1" could mean a swimming cactus. Therefore, the number of "things" that computers can store representations for is unlimited, even if the "set" of representations it can store at any given time is limited. In our specific example, the computer can store a representation of an irrational number by collapsing the number into a recursive or incremental method of reproducing the number. [[Special:Contributions/108.162.216.114\|108.162.216.114]] 20:07, 10 December 2014 (UTC)
	:"Although a computer could encode irrationals or generate them randomly if it uses another representation" - however even that is not enough. Whatever format you chooses you can only specify only definable numbers because other are... well cannot be defined. Whatever language you choose as long as you require the description to be finite you can cover only countable many of numbers. To cover all reals - including not only π or e but all of them - you need to have capability of storing infinitely large amount of memory. Similarly incremental method will give you only computable set. Either way you miss significantly large amount of numbers (ℶ₁ vs ℶ₀). This is ignoring that we cannot draw a number from natural numbers with equal probability (we would expect P(3\|X) = 1/3 and P(¬3\|X) = 2/3 but both sets are equal so we would expect P(3\|X) = P(¬3\|X)...). That's why we get random numbers for the finite set and normalize according to need. [[Special:Contributions/172.68.142.227\|172.68.142.227]] 07:55, 26 February 2017 (UTC)		:"Although a computer could encode irrationals or generate them randomly if it uses another representation" - however even that is not enough. Whatever format you chooses you can only specify only definable numbers because other are... well cannot be defined. Whatever language you choose as long as you require the description to be finite you can cover only countable many of numbers. To cover all reals - including not only π or e but all of them - you need to have capability of storing infinitely large amount of memory. Similarly incremental method will give you only computable set. Either way you miss significantly large amount of numbers (ℶ₁ vs ℶ₀). This is ignoring that we cannot draw a number from natural numbers with equal probability (we would expect P(3\|X) = 1/3 and P(¬3\|X) = 2/3 but both sets are equal so we would expect P(3\|X) = P(¬3\|X)...). That's why we get random numbers for the finite set and normalize according to need. [[Special:Contributions/172.68.142.227\|172.68.142.227]] 07:55, 26 February 2017 (UTC)
		+
		+	So nobody noticed how "this ain't random" seems to be the first thing Cueball says? I think the pun "this Ayn/ain't random" is a big part of the joke. [[User:MigB\|MigB]] ([[User talk:MigB\|talk]]) 07:22, 8 June 2022 (UTC)

← Older revision		Revision as of 07:55, 26 February 2017
Line 80:		Line 80:

	Computers don't store any "thing", they store a representation. Therefore, a computer can reference any "thing", because representation "sets" can be swapped out. At any given moment, if the user is aware, "1" could mean a purple flying dog. At any other given moment, "1" could mean a swimming cactus. Therefore, the number of "things" that computers can store representations for is unlimited, even if the "set" of representations it can store at any given time is limited. In our specific example, the computer can store a representation of an irrational number by collapsing the number into a recursive or incremental method of reproducing the number. [[Special:Contributions/108.162.216.114\|108.162.216.114]] 20:07, 10 December 2014 (UTC)		Computers don't store any "thing", they store a representation. Therefore, a computer can reference any "thing", because representation "sets" can be swapped out. At any given moment, if the user is aware, "1" could mean a purple flying dog. At any other given moment, "1" could mean a swimming cactus. Therefore, the number of "things" that computers can store representations for is unlimited, even if the "set" of representations it can store at any given time is limited. In our specific example, the computer can store a representation of an irrational number by collapsing the number into a recursive or incremental method of reproducing the number. [[Special:Contributions/108.162.216.114\|108.162.216.114]] 20:07, 10 December 2014 (UTC)
		+	:"Although a computer could encode irrationals or generate them randomly if it uses another representation" - however even that is not enough. Whatever format you chooses you can only specify only definable numbers because other are... well cannot be defined. Whatever language you choose as long as you require the description to be finite you can cover only countable many of numbers. To cover all reals - including not only π or e but all of them - you need to have capability of storing infinitely large amount of memory. Similarly incremental method will give you only computable set. Either way you miss significantly large amount of numbers (ℶ₁ vs ℶ₀). This is ignoring that we cannot draw a number from natural numbers with equal probability (we would expect P(3\|X) = 1/3 and P(¬3\|X) = 2/3 but both sets are equal so we would expect P(3\|X) = P(¬3\|X)...). That's why we get random numbers for the finite set and normalize according to need. [[Special:Contributions/172.68.142.227\|172.68.142.227]] 07:55, 26 February 2017 (UTC)

← Older revision		Revision as of 22:14, 1 November 2016
Line 77:		Line 77:

	All numbers are random, but some numbers are more random than others. [[User:Jorgbrown\|Jorgbrown]] ([[User talk:Jorgbrown\|talk]]) 23:33, 2 November 2014 (UTC)		All numbers are random, but some numbers are more random than others. [[User:Jorgbrown\|Jorgbrown]] ([[User talk:Jorgbrown\|talk]]) 23:33, 2 November 2014 (UTC)
		+	:Goddammit Jorgbrown, I was going to say that! [[Special:Contributions/108.162.237.89\|108.162.237.89]] 22:14, 1 November 2016 (UTC)

	Computers don't store any "thing", they store a representation. Therefore, a computer can reference any "thing", because representation "sets" can be swapped out. At any given moment, if the user is aware, "1" could mean a purple flying dog. At any other given moment, "1" could mean a swimming cactus. Therefore, the number of "things" that computers can store representations for is unlimited, even if the "set" of representations it can store at any given time is limited. In our specific example, the computer can store a representation of an irrational number by collapsing the number into a recursive or incremental method of reproducing the number. [[Special:Contributions/108.162.216.114\|108.162.216.114]] 20:07, 10 December 2014 (UTC)		Computers don't store any "thing", they store a representation. Therefore, a computer can reference any "thing", because representation "sets" can be swapped out. At any given moment, if the user is aware, "1" could mean a purple flying dog. At any other given moment, "1" could mean a swimming cactus. Therefore, the number of "things" that computers can store representations for is unlimited, even if the "set" of representations it can store at any given time is limited. In our specific example, the computer can store a representation of an irrational number by collapsing the number into a recursive or incremental method of reproducing the number. [[Special:Contributions/108.162.216.114\|108.162.216.114]] 20:07, 10 December 2014 (UTC)