How does one implements GENSYM[1] in a robust and thread safe way? What if several programs have to interchanged generated SEXPs, so that symbols wont clash? Say two different compilers gensyming assembly output may produce clashing identifiers.
How does one implement GENSYM[1] in a robust and thread safe way?
By locking the symbol table when interning a new symbol.
What if several programs have to interchange generated SEXPs, so that symbols wont clash?
Force symbols gensymed by different programs to reside in different packages.
Say two different compilers gensyming assembly output may produce clashing identifiers.
Add a concept of scope and make gensymed variables local.
Name:
Anonymous2013-06-27 8:34
I am a transgensymed person.
Name:
Anonymous2013-06-27 9:03
Gensym is a computational construct.
Name:
Anonymous2013-06-27 11:29
>>6 By locking the symbol table when interning a new symbol.
What if we use bare-string instead and program runs across a network of several machines, each having own symbol table?
>>10
If you generate trillions GUIDs every second, it would still take thousands of years to get a duplicate. On the other hand, a thousand of PCs can do it in single year.
Name:
Anonymous2013-06-27 15:50
>>6 scope
I don't need no stinkin' scope! #define faggot fourchan_prog_faggot
ShitPoster op = faggot; *le macro face*
Name:
Anonymous2013-06-27 15:51
>>9
Maybe we can attach the CPU number and the cycle counter to the GUID.
Name:
Anonymous2013-06-27 17:25
>>13
Intel Jews removed the "CPU number" feature, because another Jewish "hacktivist", David Smith, got caught because of that. It is a shame this evil hacker havent committed a suicide, like Aaron did.
Name:
Anonymous2013-06-27 18:00
>>14
You are very "intelligent". I would really "like" to meet you in real life so I could "congratulate" you on your "brilliance".
>>9
Prepend all gensymed symbols with an id unique to all machines in the network.
printed SEXPs dont have packages.
They do if you print them like:this.
Name:
Anonymous2013-06-28 8:37
I am gensymqueer.
Name:
Anonymous2013-06-28 8:43
>>17 They do if you print them like:this.
that is a nonstandard extension.
Name:
Anonymous2013-06-28 23:18
>>19
I'm talking about common lisp. If you could nest package names it would be ENTERPRISE QUALITY
Name:
Anonymous2013-08-31 7:33
He graduated from Berlin's Luisenstädtisches Gymnasium in 1889. He then studied mathematics, physics and philosophy at the universities of Berlin, Halle and Freiburg. He finished his doctorate in 1894 at the University of Berlin, awarded for a dissertation on the calculus of variations (Untersuchungen zur Variationsrechnung). Zermelo remained at the University of Berlin, where he was appointed assistant to Planck, under whose guidance he began to study hydrodynamics. In 1897, Zermelo went to Göttingen, at that time the leading centre for mathematical research in the world, where he completed his habilitation thesis in 1899.
Name:
Anonymous2013-08-31 8:17
κ0 = 1 (in particular 00 = 1), see empty function.
Name:
Anonymous2013-08-31 9:03
The continuum hypothesis states that there is no cardinal number between the cardinality of the reals and the cardinality of the natural numbers, that is, \mathbf{c} = leph_1 = eth_1 (see Beth one). However, this hypothesis can neither be proved nor disproved within the widely accepted Zermelo–Fraenkel set theory, even assuming the Axiom of Choice.
Name:
Anonymous2013-08-31 9:48
Intersection of the sets A and B, denoted A ∩ B, is the set of all objects that are members of both A and B. The intersection of {1, 2, 3} and {2, 3, 4} is the set {2, 3} .
Name:
Anonymous2013-08-31 10:34
Ludwig Wittgenstein questioned the way Zermelo–Fraenkel set theory handled infinities.Wittgenstein's views about the foundations of mathematics were later criticised by Georg Kreisel and Paul Bernays, and investigated by Crispin Wright, among others.
Name:
Anonymous2013-08-31 11:19
Until the late 19th century, the axiom of choice was often used implicitly, although it had not yet been formally stated. For example, after having established that the set X contains only non-empty sets, a mathematician might have said "let F(s) be one of the members of s for all s in X."