>>3
So far I keep coming to the conclusion that Ruby is just a bad ripoff of Python, just like C# is a bad ripoff of C++ and to some degree Java
Name:
Anonymous2011-03-26 8:42
The hyper-enthusiasts are seemingly always going to congregate in some language. Once, they were in the Java camp. Today, they're in Ruby. I'm not speaking to these people; I'm speaking to the serious, intelligent programmer who has discovered that Ruby "fits his brain" like no other language before, but may be at a loss to explain in detailed scientific terms exactly why this might be so.
But – and this is going to be the hardest part to swallow – from the point of view of academic computer scientists like Dr. Huntbach, Ruby honestly introduces nothing new, and confuses some underlying concepts in ways which are, frankly, dangerous.
Name:
Anonymous2011-03-26 8:44
Ruby honestly introduces nothing new, and confuses some underlying concepts in ways which are, frankly, dangerous.
Japs can't invent, only embrace, extend and extinguish.
foo() # foo should set the outer a to 2
print a # so this should print '2'
This prints 3, because foo() didn't modify the variable in the enclosing scope. foo() can read the value of a from the outer scope; it just can't write to it, unless you use an explicit global declaration inside foo, or you write to the globals dictionary directly, like so:
a = 3
def foo():
globals()['a'] = 2
foo() # foo should set the outer a to 2
print a # so this should print '2'
Name:
Anonymous2011-03-26 11:12
>>11
($eval "a =: 3; (foo -> a=:2); foo; a")
3
Compiling: foo
no
2
2
($eval "a =: 3; (foo -> a:2); foo; a")
3
Compiling: foo
no
2
3
Ernst Friedrich Ferdinand Zermelo (German: [ʦɛrˈmeːlo]; 1871–1953) was a German logician and mathematician, whose work has major implications for the foundations of mathematics.
Name:
Anonymous2013-08-31 23:21
Assuming the axiom of choice and, given an infinite cardinal π and a non-zero cardinal μ, there exists a cardinal κ such that μ · κ = π if and only if μ ≤ π. It will be unique (and equal to π) if and only if μ < π.
Name:
Anonymous2013-09-01 0:06
If a set is too large to be put in one to one correspondence with the positive integers, it is called uncountable. Cantor's views prevailed and modern mathematics accepts actual infinity. Certain extended number systems, such as the hyperreal numbers, incorporate the ordinary (finite) numbers and infinite numbers of different sizes.
Name:
Anonymous2013-09-01 0:51
Just as arithmetic features binary operations on numbers, set theory features binary operations on sets. The:
Name:
Anonymous2013-09-01 1:37
A famous problem is the normal Moore space question, a question in general topology that was the subject of intense research. The answer to the normal Moore space question was eventually proved to be independent of ZFC.
Name:
Anonymous2013-09-01 2:22
The statement of the axiom of choice does not specify whether the collection of nonempty sets is finite or infinite, and thus implies that every finite collection of nonempty sets has a choice function. However, that particular case is a theorem of Zermelo–Fraenkel set theory without the axiom of choice (ZF); it is easily proved by mathematical induction.