Live data from Hacker News

Viewing profile — dewster

dewster

HN member
Joined
Fri, Feb 12, 2016, 5:04 PM UTC
HN karma
91
Public activity
67 items

About dewster

No profile information was provided.

Recent public activity

  1. comment
    Comment #43920611

    That's me actually! :-)

  2. comment
    Comment #43913588

    AFAIK Carolina only uses the D-Lev pitch circle for coming in on pitch, not for active playing. That's pretty typical for players who have learned on an analog Theremin, where they…

  3. comment
    Comment #43909838

    There are 50 or so kits spread out all over the world, some in the hands of the world's best Thereminists, which has been quite gratifying. But the project has been in a bit of a h…

  4. comment
    Comment #43906378

    The D-Lev has a fairly extensive MIDI implementation, and you can control any CC with the volume hand (7 or 14 bits), so perhaps something like this would be possible if the synth …

  5. comment
    Comment #43905327

    Here's Carolina playing the D-Lev: https://www.youtube.com/watch?v=0vjJ2SG5cVA She's a super sweet person, and a consummate musician!

  6. comment
    Comment #43904252

    The "digital one" Carolina refers to is my open source D-Lev design: https://d-lev.com/

  7. comment
    Comment #22874264

    The problem with trivial ops like stack manipulations is that they don't really do anything useful, but they can take as long as multiply in the pipeline. Stack machines made more …

  8. comment
    Comment #22868779

    A stack processor will always be less efficient than a two or three operand register-based processor. This is because all of the the registers can be used directly without any stac…

  9. comment
    Comment #22023991

    "...and given each chip has 144 entire computers on it..." Entire computers? What decade is it again?

  10. comment
    Comment #22022077

    I meant that he's a genius at the whole stack machine / language shaman thing. 32 bits are unnecessary?!? I suppose a 18 bit machine would run a lot "faster" than a 32 bit machine …

  11. comment
    Comment #22021448

    Multi-core F18A technology, each of which is a simple 18 bit processor. IMO, anything less than 32 bits (with internal 33 x 33 = 65 bit multiply) falls into the primitive category …

  12. comment
    Comment #22021373

    I briefly skimmed [1] and their more sophisticated translation to a register VM yielded a 25% increase in code size, and not the 45% you stated? Regardless, VM to VM really isn't m…

  13. comment
    Comment #22020265

    The Forth success stories tend to be really, really ancient, and therefore almost irrelevant. Much like Chuck's arguments for the merits of stack languages / machines. Processor pi…

  14. comment
    Comment #22019988

    I would argue that a language targeting bare metal type applications should at least be minimally aware of that underlying hardware. A single stack "virtual machine" type language …

  15. comment
    Comment #21964025

    If you actually look at the way Forth works you'll see that every stack manipulation wastes code space and real-time. Since there is only one data stack there are a lot of stack ma…

  16. comment
    Comment #15612470

    Developing on the target is just so last century. Now that programmers have developed the IDE you'll have to pull them from their cold dead hands.

  17. comment
    Comment #15610960

    Both. And under the hood, Forth implements a virtual stack machine on top of a non-stack machine, which is inefficient. I guess I'm just trying to counter all the mythos and happy …

  18. comment
    Comment #15607530

    It's called factoring with subroutines, and Forth hasn't cornered the market on anything by calling them words.

  19. comment
    Comment #15607518

    I don't think the stack in a traditional languages is the same as stacks in stack machines and languages. It's a lump of memory that gets allocated to a thread for stuff, and the a…

  20. comment
    Comment #15607479

    Pure stack machines don't have local variables. They have at most two stacks and that's it.

  21. comment
    Comment #15605170

    THE central problem with pure stack machines and stack languages: The programmer knows in their heart that moves, swaps, dupes, drops, etc. - any stack manipulation that doesn't in…

  22. comment
    Comment #12211441

    I agree. Not trying to be racist, but I find that British authors are quite often unnecessarily verbose, so I'm somewhat gun shy when picking up their books. One notable exception …

  23. comment
    Comment #12190329

    Again, I'm most likely an idiot, but I'm just not seeing it in any of the examples I've encountered. Not trying to be dense, I realize the onus is mostly on me here, and I really a…

  24. comment
    Comment #12190260

    Your initial words were "Here is how you can use the lambda calculus to compute factorials in non-geological time" which led me to believe you were claiming LC was a very (the most…

  25. comment
    Comment #12189913

    If we were playing the Hot and Cold game you would be getting colder. Are you telling me that the most efficient means of generating factorials is via LC? That no other method can …