The nice thingg about kombinator calculus is that there's no variable names. You only have one , unnamed, argument to each kombinator. This makes the definition of the evaluator much simpler than that of the evaluator of lambda calculus (which is what Scheme/LISP basicly boils down to)...
Hehe, call/cc (call-with-current-continuation, for those that likes long names, or doesn't know what it is; it's like setjump/longjmp in C, but a continuation can be "jumped to" several times, from anywhere, even after the function in which it was created (setjump in C) has returned (once or several times)) is a really nice feature, with which you can implement both exceptions and threading...
Perheaps I should take a look at that unlambda language, I read about it somtime ago, but I don't really have time for an intensive night of hacking/reading atm...
This is a question of security by obscurity. If everyone used exactly this technic to hide their data, everyone and their dog will be able to recover it. But if everyone hides their data at different places (I hide mine in the most insinificant bits in a picture, you hide yours in teh filesystem, etc), we'l increase the workd needed to find any given information.
If you think that "if you are innocent, you have nothing to hide", then certainly, this has no uses. Otherwise, it has lots of uses:)
Hiding dirty pictures of you and your SO from parents perheaps?
No, just _moving_ it does not free the block. You must either move it to another disk, or copy it and remove all had links to it.
Hm, time for us non-US-ians to start pining them just by random, just for the fun of it, perheaps? Or will the send death-squads to Europe to kill me then?
And MS is talking about GPL being "viral"! I nwould advice anyone hacking on a GPLed, similar project (DotGNU etc) not to look at this source at all, and not have this sourc downloaded by any of their IP-numbers.
I guess people will just start reusing old parts in that case... Perheaps the environmentalists should be told about this:] But actually, I think that for the hardware-companies, implementing such a thing is suicide... And if all of them agree to do this, they'l get sued for cartell-creation!
You mean the swiss Army Chainsaw, I suppose? The point of the tools methodology is that you, most of the time, carry only a hammer, a knife, a screwdriver and some other "general-purpose" tools. But when you need to do some welding too, you just bring the tools you need for that, and they'l work "together with your hammer". Even MS recognizes this, with the advent of OLE and later ActiveX. What is needed is a good tool-builders-tool (aka system library), that provides for the common needs of tools (like undo, versioning, configurration, look, etc). Actually, I'm running a project aimed at this...
Re:Moving away from X
on
Xfree86 4.2.0 Out
·
· Score: 3, Interesting
You do not want to merge the widgetset and the windowing engine, as (drawing) area clipping and buffering has absolutely nothing to do with each other. In addition, do you honestly think that would help the adoption of the new system? It would just be a new war such as the Gtk/Qt/Athena/Motif/Tk one. But including the windowing engine. Imagine if you could not run a KDE app inside your GNOME desktop!
I see the need for two things:
a) a new windowing server supporting partial transparency, anti-aliased text, non-horisontal text, virtual colour-depths (that is, that the app wouldn't know what the real colour-deph was, so that they could be moved between displays with different depths without noticing it) and moving of clients bweteen servers.
b) a client-server (or just back-end/front-end) aproach to the widget-set too, so that the programmer could use any widgetset library he/she wants, and the user still be able to switch the look and feel of the app to match the rest of his/her apps.
It is more like, what about the under-18 US citizens who may have just violated their country's laws by clicking that link? You know, you'r not the most liberal country in the world when it comes to sex, and you for sure get more upset in your country about it, than most people in e.g. europe does... Anyway, this is what actually belongs here under the "Your rights online" departement; it is about a lawsuit where Lucasfilm atempted to supress parody based on moralism. If you don't like "morally wrong" things, then just stay out of that departement!
./~ I'm a eurotroll, a eurotroll trolling in seine./~
Point is, your export laws doesn't stop us, or enyone, since we have our own encryption, developed at various places outside the US (Like.fi (ssh communications) or.se (KTH is doing some serious kerberos hacking). You USians does the same error all the time - you think you are the _only_one_ with high-tech. Sorry, but you are not...
./~ I'm a eurrotroll, trolling in seine, in main and the english channel, but no-where can I find a USian in there to catch, for that, I go to slashdot to troll. Hey, I'm a eurotroll!./~
I must admit it was some time since I hacked CL, and that I am biased towards Scheme. Scheme does require a GC, aswell as certain constructs of the language to be tail-recursion-optimized.
Okay, LISP doesn't lack objects, but it does lack (automatic) function dispatching depending on the type of an object. But this could easily be hacked into it, if someone wanted to:)
I have read some about MOP, and am really impressed. That is probably one of LISPs biggest strengths - introspection. All aspects of a program, and the language, can be determined, and controlled, by the progrram itself.
I have read some of the CL HyperSpec. But as I said before, I'm blinded by Scheme after reading too much of r5rs and the SRFIs:)
Re:Rule 1 of Efficient Lisp: Lisp is not functiona
on
Common Lisp: Inside Sabre
·
· Score: 3, Informative
Functional programming vs. imperative programming have nothing to do with efficiency. At least not run-time efficiency.
For an example of an (very basic, and done by all LISP implementations, and even partly by some C compilers, e.g. gcc) optimization, see "tail recursion optimization" in your nearest LISP-implementation documentation.
As yoy state, some problems are "inherently" imperative, and some are functional, to their nature, but that has more to do with how easily their solution is formalised in either formalism, not how well that solution is then executed.
But I think one should not emphasis that property as much as that LISP does have a garbage collector, which C does not have. It does not _allow_ for you to have neither memory leaks, nor crashes due to multiple free()'s of the same location. And it doesn't have any sprintf() that can produce buffer overruns. But OK, then you could use Java:) Java is just LISP with objects and fancier syntax...
Also, as you state, lambdas and higher-order-functions are central to what's good about LISP.
It is not X-Windows, It is either reffered to as just X, or The X Windowing System or The X Window System. X Window System is the only term registered as a trademark by The OpenGroup/The X Consortium. The system is also sometimes rreffered to as its major version, that is X11 or major version and revision, that is X11R6.
Hehe, I emember you could drag a drive-icon from its map to the dectop or something, and not be able to drag it back again or something...
Btw, I'm hacking on something I call Editor's Shell, which is to borrow a lot from the OS/2 Workspace Shell. But a lot of things will be different, especially the back-end, object management API, which is nearly finnished.
Why not learn Scheme? It is weel suited for implementing recursive algorithms in a straight-forward way. Also, may I suggest learning some logic-based language, like prolog, with a finite domain solver included (as the one in gprolog)? I don't know, since I'm no engineer, but I can imagine a finite domain solver being usefull for engineering tasks (it can be used for e.g. scheduling several tasks to reduce resource usage and the like).
"It would be interesting to see how many problems we could map into the NP Complete model."
The point is, everything that is not NP-complete, and still computable that has been found by man to date, is NP-complete (that is, exponential; O(a^n) for some a). The definition of NP-completeness is that it, using an algorithm of polynomial complexity (or O(n^a) for some a), can be mapped onto any other NP-complete problem, and thus solved using algorithms for it.
Thus, if an algorithm where found to solve one specific NP-complete problem in polynomial time, all of the NP-complete problems would be possible to compute in polynomial time (polynomial time to map it onto that particular problem for which we have the algorithm, plus polynomial time to solve it, and a polynom plus another is still a polynom).
Trivia: The "standard" NP-complete problem is SAT, which is the problem of finding out if there exists assignements of truth-values (TRUE and FALSE) for the variables of a logic formula, that makes the value of the formula TRUE.
A better system would just be to block all mails not signed with GPG/PGP with a key which you have previously accepted, and for all the rest of the mails just send a reply stating the myst first send a signed message (but signed with an unaproved key) with the subject "I want to send you e-mail" (or something like that), except those with such a subject-line, which would be put in a special mail folder, for you to check as you like... Of course, mailprograms would then have to facilitate encryption... You could even do this without signing, and just match on aproved adresses instaed...
The cost of finding them is just asking them "in which row, and in which colum, do you sit", and then walking the manhattan distance over there...
Last time I visited DH, I actually got to know quite some new people.
Re:NOT a lan party you fucks.
on
Dreamhack 2001
·
· Score: 4, Insightful
It _was_ a demoparty, and I used to go there, but now, to what reason? Last time I was there, there where gamers there, a lot of them, but they at least had demo competitions... I made a 512 bytes mini-intro (just for fun, there where no matching competition) with a friend...
Btw, I'l bite and answer two other messages:
There's no snow at all in Jönköping atm (or in any town in south sweden).
Sweden is a _long_ country, so this it's-dark-all-winter-and-bright-all-summer doesn't apply that much at all to e.g. Jönköping. But anyway, what does it matter when you'r in a building four days in a row, with ponly the light of thopusand monitors to guid you?
DH used to be in another, more northern town (borlänge) before, but even there, there where no snow and quite bright...
Btw, if you want to go to a _real_ demoparty, visit The Gathering in Norway!
If you have done nothing, you have nothing to fear
on
Path of Least Surveillance
·
· Score: 3, Interesting
I've read a lot of comments stating more or less "f you have done nothing, you have nothing to fear". The problems with the cameras have nothing to do with criminals getting caught (thats a good thing imho), or someone who shouldn't have seen it, accidentally whatching you and your lover kissing... It has to do with demonstrations. In A free country, you are allowed to walk in a demonstration to show your political standpoint, without the police recording your personal presence! Such recording is in e.g. Sweden called opinion registration, and is forbidden by our constitution!
SMS still goes via the masts. What would be übercool would be if the phones could route messages among each other. But that will never happen, as that would ruin the teleco:s buisinesses...
The nice thingg about kombinator calculus is that there's no variable names. You only have one , unnamed, argument to each kombinator. This makes the definition of the evaluator much simpler than that of the evaluator of lambda calculus (which is what Scheme/LISP basicly boils down to)...
Hehe, call/cc (call-with-current-continuation, for those that likes long names, or doesn't know what it is; it's like setjump/longjmp in C, but a continuation can be "jumped to" several times, from anywhere, even after the function in which it was created (setjump in C) has returned (once or several times)) is a really nice feature, with which you can implement both exceptions and threading...
Perheaps I should take a look at that unlambda language, I read about it somtime ago, but I don't really have time for an intensive night of hacking/reading atm...
This is a question of security by obscurity. If everyone used exactly this technic to hide their data, everyone and their dog will be able to recover it. But if everyone hides their data at different places (I hide mine in the most insinificant bits in a picture, you hide yours in teh filesystem, etc), we'l increase the workd needed to find any given information.
:)
If you think that "if you are innocent, you have nothing to hide", then certainly, this has no uses. Otherwise, it has lots of uses
Hiding dirty pictures of you and your SO from parents perheaps?
No, just _moving_ it does not free the block. You must either move it to another disk, or copy it and remove all had links to it.
Hm, time for us non-US-ians to start pining them just by random, just for the fun of it, perheaps? Or will the send death-squads to Europe to kill me then?
And MS is talking about GPL being "viral"! I nwould advice anyone hacking on a GPLed, similar project (DotGNU etc) not to look at this source at all, and not have this sourc downloaded by any of their IP-numbers.
I guess people will just start reusing old parts in that case... Perheaps the environmentalists should be told about this :] But actually, I think that for the hardware-companies, implementing such a thing is suicide... And if all of them agree to do this, they'l get sued for cartell-creation!
You mean the swiss Army Chainsaw, I suppose? The point of the tools methodology is that you, most of the time, carry only a hammer, a knife, a screwdriver and some other "general-purpose" tools. But when you need to do some welding too, you just bring the tools you need for that, and they'l work "together with your hammer". Even MS recognizes this, with the advent of OLE and later ActiveX. What is needed is a good tool-builders-tool (aka system library), that provides for the common needs of tools (like undo, versioning, configurration, look, etc). Actually, I'm running a project aimed at this...
You do not want to merge the widgetset and the windowing engine, as (drawing) area clipping and buffering has absolutely nothing to do with each other. In addition, do you honestly think that would help the adoption of the new system? It would just be a new war such as the Gtk/Qt/Athena/Motif/Tk one. But including the windowing engine. Imagine if you could not run a KDE app inside your GNOME desktop!
I see the need for two things:
a) a new windowing server supporting partial transparency, anti-aliased text, non-horisontal text, virtual colour-depths (that is, that the app wouldn't know what the real colour-deph was, so that they could be moved between displays with different depths without noticing it) and moving of clients bweteen servers.
b) a client-server (or just back-end/front-end) aproach to the widget-set too, so that the programmer could use any widgetset library he/she wants, and the user still be able to switch the look and feel of the app to match the rest of his/her apps.
It is more like, what about the under-18 US citizens who may have just violated their country's laws by clicking that link? You know, you'r not the most liberal country in the world when it comes to sex, and you for sure get more upset in your country about it, than most people in e.g. europe does... Anyway, this is what actually belongs here under the "Your rights online" departement; it is about a lawsuit where Lucasfilm atempted to supress parody based on moralism. If you don't like "morally wrong" things, then just stay out of that departement!
./~ I'm a eurotroll, a eurotroll trolling in seine ./~
.fi (ssh communications) or .se (KTH is doing some serious kerberos hacking). You USians does the same error all the time - you think you are the _only_one_ with high-tech. Sorry, but you are not...
./~
Point is, your export laws doesn't stop us, or enyone, since we have our own encryption, developed at various places outside the US (Like
./~ I'm a eurrotroll, trolling in seine, in main and the english channel, but no-where can I find a USian in there to catch, for that, I go to slashdot to troll. Hey, I'm a eurotroll!
I must admit it was some time since I hacked CL, and that I am biased towards Scheme. Scheme does require a GC, aswell as certain constructs of the language to be tail-recursion-optimized.
:)
:)
Okay, LISP doesn't lack objects, but it does lack (automatic) function dispatching depending on the type of an object. But this could easily be hacked into it, if someone wanted to
I have read some about MOP, and am really impressed. That is probably one of LISPs biggest strengths - introspection. All aspects of a program, and the language, can be determined, and controlled, by the progrram itself.
I have read some of the CL HyperSpec. But as I said before, I'm blinded by Scheme after reading too much of r5rs and the SRFIs
Functional programming vs. imperative programming have nothing to do with efficiency. At least not run-time efficiency.
:) Java is just LISP with objects and fancier syntax...
For an example of an (very basic, and done by all LISP implementations, and even partly by some C compilers, e.g. gcc) optimization, see "tail recursion optimization" in your nearest LISP-implementation documentation.
As yoy state, some problems are "inherently" imperative, and some are functional, to their nature, but that has more to do with how easily their solution is formalised in either formalism, not how well that solution is then executed.
But I think one should not emphasis that property as much as that LISP does have a garbage collector, which C does not have. It does not _allow_ for you to have neither memory leaks, nor crashes due to multiple free()'s of the same location. And it doesn't have any sprintf() that can produce buffer overruns. But OK, then you could use Java
Also, as you state, lambdas and higher-order-functions are central to what's good about LISP.
It is not X-Windows, It is either reffered to as just X, or The X Windowing System or The X Window System. X Window System is the only term registered as a trademark by The OpenGroup/The X Consortium. The system is also sometimes rreffered to as its major version, that is X11 or major version and revision, that is X11R6.
Or just submit .rtf documents renamed to .doc, and they won't see any difference :]
Hehe, I emember you could drag a drive-icon from its map to the dectop or something, and not be able to drag it back again or something...
Btw, I'm hacking on something I call Editor's Shell, which is to borrow a lot from the OS/2 Workspace Shell. But a lot of things will be different, especially the back-end, object management API, which is nearly finnished.
Why not learn Scheme? It is weel suited for implementing recursive algorithms in a straight-forward way. Also, may I suggest learning some logic-based language, like prolog, with a finite domain solver included (as the one in gprolog)? I don't know, since I'm no engineer, but I can imagine a finite domain solver being usefull for engineering tasks (it can be used for e.g. scheduling several tasks to reduce resource usage and the like).
Then run a Transmeta and rewrite their codemorpher as Free Software! There is a final solution to the windows problem.
"It would be interesting to see how many problems we could map into the NP Complete model."
The point is, everything that is not NP-complete, and still computable that has been found by man to date, is NP-complete (that is, exponential; O(a^n) for some a). The definition of NP-completeness is that it, using an algorithm of polynomial complexity (or O(n^a) for some a), can be mapped onto any other NP-complete problem, and thus solved using algorithms for it.
Thus, if an algorithm where found to solve one specific NP-complete problem in polynomial time, all of the NP-complete problems would be possible to compute in polynomial time (polynomial time to map it onto that particular problem for which we have the algorithm, plus polynomial time to solve it, and a polynom plus another is still a polynom).
Trivia: The "standard" NP-complete problem is SAT, which is the problem of finding out if there exists assignements of truth-values (TRUE and FALSE) for the variables of a logic formula, that makes the value of the formula TRUE.
a) A new act is on its way that requires any digital device to have Digital Rights Management.
b) MicroSoft is granted a patent on Digital Rights Management in Operating Systems, and thus for any programmable digital device.
Does this sound just a bit like MS just bought themeselves totalitarian authority over Corporate States of America?
A better system would just be to block all mails not signed with GPG/PGP with a key which you have previously accepted, and for all the rest of the mails just send a reply stating the myst first send a signed message (but signed with an unaproved key) with the subject "I want to send you e-mail" (or something like that), except those with such a subject-line, which would be put in a special mail folder, for you to check as you like... Of course, mailprograms would then have to facilitate encryption... You could even do this without signing, and just match on aproved adresses instaed...
Why _normal_time_ in binary, not miliseconds from The Epoch?
May The TRue Time be with you!
The cost of finding them is just asking them "in which row, and in which colum, do you sit", and then walking the manhattan distance over there...
Last time I visited DH, I actually got to know quite some new people.
It _was_ a demoparty, and I used to go there, but now, to what reason? Last time I was there, there where gamers there, a lot of them, but they at least had demo competitions... I made a 512 bytes mini-intro (just for fun, there where no matching competition) with a friend...
Btw, I'l bite and answer two other messages:
There's no snow at all in Jönköping atm (or in any town in south sweden).
Sweden is a _long_ country, so this it's-dark-all-winter-and-bright-all-summer doesn't apply that much at all to e.g. Jönköping. But anyway, what does it matter when you'r in a building four days in a row, with ponly the light of thopusand monitors to guid you?
DH used to be in another, more northern town (borlänge) before, but even there, there where no snow and quite bright...
Btw, if you want to go to a _real_ demoparty, visit The Gathering in Norway!
I've read a lot of comments stating more or less "f you have done nothing, you have nothing to fear". The problems with the cameras have nothing to do with criminals getting caught (thats a good thing imho), or someone who shouldn't have seen it, accidentally whatching you and your lover kissing... It has to do with demonstrations. In A free country, you are allowed to walk in a demonstration to show your political standpoint, without the police recording your personal presence! Such recording is in e.g. Sweden called opinion registration, and is forbidden by our constitution!
SMS still goes via the masts. What would be übercool would be if the phones could route messages among each other. But that will never happen, as that would ruin the teleco:s buisinesses...
Nope, he needs libncurses5 and libncurses5-devel in addition to ncurses...