Easy as { 1 2 3 }? (when { 1 2 3 } ≠ { 1 2 3 })
|
07-17-2018, 03:05 AM
Post: #12
|
|||
|
|||
RE: Easy as { 1 2 3 }?
(07-16-2018 04:25 AM)Claudio L. Wrote: ... Thanks for the kind words, Claudio, and also for the explanation of newRPL's approach. As per your usual, it seems like a sensible and well thought-out way to handle things. I'm actually a fan of what you're doing with the platform, and would definitely be inclined to help out if I could. Unfortunately C is not in my bag of tricks at present, though I've started going down that path on numerous occasions since the early eighties. Something has always seemed to derail those plans. I hope you have some success with your investigations into a newRPL application for the Prime -- that could be an interesting endeavor. Likewise, some kind of newRPL implementation on a Swiss Micros platform would probably draw some interest as well. There's lots of possibilities, and so little time... |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 2 Guest(s)