HP Forums
Where can I get the (RPN) goods? - Printable Version

+- HP Forums (https://archived.hpcalc.org/museumforum)
+-- Forum: HP Museum Forums (https://archived.hpcalc.org/museumforum/forum-1.html)
+--- Forum: Old HP Forum Archives (https://archived.hpcalc.org/museumforum/forum-2.html)
+--- Thread: Where can I get the (RPN) goods? (/thread-220338.html)



Where can I get the (RPN) goods? - Matt Agajanian - 05-07-2012

Hello all.

I already have the big four RPN encyclopedias in my library--'Everything You've Always Wanted To Know About RPN...' from TK Enterprises (geesh, there's a memory lane trip! Remember them, along with Freeway Stores and Computique), Jean-Daniel Dodin's 'ENTER,' John A. Ball's "Algorithms for RPN Calculators' and 'Computational Analysis With the HP-25C Pocket Calculator' by Peter Henrici (thanks to Trent Moseleley here to suggest it from my earlier post). So, can you recommend any other RPN/HP-centered books I should add to my library and RPN programming toolkit?

Thanks


Edited: 7 May 2012, 5:23 p.m.


Re: Where can I get the (RPN) goods? - Felix Gross - 05-07-2012

Many books can be found on the HP Museum DVD in the form of pdf-files. The DVD 2 also contains the "Calculator Reference Literature List V1.4.4" with more than 700 references to books.

The current version of the list comprises information about more than 1000 books and more than 1600 articles, research reports and other publications. They represent more than 220.000 pages. Many of the publications are freely available in internet databases. Just look around, the material is out there.

As soon as I have added ca. 300 more datasets I will make a new version available. And as always I do welcome information about all calculator references. Especially in languages other than English or German.

Cheers,

Felix




Re: Where can I get the (RPN) goods? - Matt Agajanian - 05-07-2012

Thanks. I'll load up the MoHPC DVD and see what I can discover.


Re: Where can I get the (RPN) goods? - bluesun08 - 05-08-2012

Matt, please give me an advice: Which of the above "big four" books is the best in your mind?


Re: Where can I get the (RPN) goods? - Matt Agajanian - 05-08-2012

Hi there.

The most potent info for my RPN toolkit has been the 'Algorithms for RPN Calculators.' The tips in its favour are:

1--a section which analyzes the various entry methods also includes a list of 250+ stack manipulators to produce any combination of X, Y, Z and T values in the stack.

2--Another part of that book features some quite essential RPN forms for the various algebra, logarithm and trigonometry identities which are keystroke efficient.

3--As the book progresses, various application programs are featured in Statistics, Mathematics and Engineering. The algorithms are so well clarified and notated that they can be translated easily into programming code. For example, loops are so marked that you can see where the loop begins and ends and that way, DSZ/ISZ or conditional branching instructions can be simply implemented around the algorithm for programming anything from an HP-25 to HP-48 depending on memory of the calc, of course.

This book is still loitering around on Amazon and eBay.

My second choice is the TK Enterprises 'Everything You've Always Wanted To Know About RPN...'

Like 'Algorithms,' the analysis given to RPN in addition to the history of Lukasiewicz's method is detailed.

Afterwards, the book is a vast application library which, like 'Algorithms...' can be transformed and modified for HP-calc applications.

There is also a reference in the back for the formulas used example calculators base instructions. For example, on the Corvus 500, there is a hyperbolic polar<-->rectangular function. So, as the appendix lists the Corvus 500 built-ins, the formulas are also listed. This gives the opportunity to implement some of the unique Corvus functionality into another machine.

If you put 'Everything RPN' (omit apostrophes) into Google, the first listing that appears is the PDF of the book which can be freely downloaded.

Enjoy.


Edited: 8 May 2012, 11:41 a.m.