Search
Member List
Calendar
Help
|
The sophisticated HP-65
|
|
08-01-2022, 10:12 PM
Post: #1
|
|||
|
|||
|
The sophisticated HP-65
Even with 100 semi-merged steps and nine (eight if you’re using functions that need R9), the HP-65 can definitely be a strong programmable.
So, what is the most sophisticated program you’ve written for the 65? |
|||
|
|
08-02-2022, 02:48 AM
(This post was last modified: 08-06-2022 04:11 AM by [kby].)
Post: #2
|
|||
|
|||
|
RE: The sophisticated HP-65
I managed to do all 6 hyperbolics and inverses in 100 steps accessed through spelling out the function with the 5 soft keys as “arc”, “co”, “sin”, “tan”, and “sec.”
I’ve tried getting a two variable stats package using a common summation logic and merge-able cards but haven’t quite figured out how to squeeze out a few more steps yet. |
|||
|
|
|
08-02-2022, 05:05 PM
(This post was last modified: 08-03-2022 06:44 AM by C.Ret.)
Post: #3
|
|||
|
|||
RE: The sophisticated HP-65
(08-01-2022 10:12 PM)Matt Agajanian Wrote: So, what is the most sophisticated program you’ve written for the 65? Up to now, the most sophisticated program I write for the HP-65 is concerning the position of any rational in the Calkin–Wilf tree. It was a part of the numerous exchanges and works-out from the MPO96 challenge in the french forum www.silicium.org (Sept 06,2020). Label A is used to calculate the index of U(n) from the rational A/B (the GCD is in register R2 at the end of the calculation): a [ENTER^] b (A) displays U(n) . Label D makes it possible to determine the rational A/B from the index of U(n): n [ D ] displays A then [SST] displays B. |
|||
|
|
|
08-02-2022, 08:30 PM
Post: #4
|
|||
|
|||
RE: The sophisticated HP-65
(08-02-2022 05:05 PM)C.Ret Wrote: It was a part of the numerous exchanges and works-out from the MPO96 challenge in the french forum www.silicium.org (Sept 06,2020). This whole thread is worth reading but this is golden: Quote:Tu me rappelles le temps béni où je travaillais à Marseille, la ligne de TGV fonctionnait de puis quelques semaines, un collègue fort sympathique, marseillais de bonne souche, était très fier d'annoncer à tout le monde qu'il était le plus rapide d'entre nous, un "champoing du monde" qui sera dans moins de 5h à Paris. Sauf qu'il est monté du mauvais coté de la rame qui se séparée à Avignon, il est arrivé à destination encore plus vite, en moins de 3h il était à Toulouse. Here's the program that can be used in this online emulator for the HP-65: Code: PROGExamples 11 ENTER↑ 28 A 500.00 500 D 11.00 R/S 28.00 FYI: There are some inconsistencies between the numeric codes and their textual representations. I assumed that the latter is correct. Code: 008: 33 04 : STO 4 |
|||
|
|
|
08-02-2022, 11:22 PM
Post: #5
|
|||
|
|||
RE: The sophisticated HP-65
(08-01-2022 10:12 PM)Matt Agajanian Wrote: Even with 100 semi-merged steps and nine (eight if you’re using functions that need R9), the HP-65 can definitely be a strong programmable. prime factor finder |
|||
|
|
|
08-03-2022, 12:08 AM
Post: #6
|
|||
|
|||
|
RE: The sophisticated HP-65
Everyone should check the early issues of the PPC Calculator Journal (what? you don't have the PDF copies of all those issues? - it's on the HHC conference drive and Jake Schwartz sells the scans cheap!)
Whole issues devoted to game programs as well as incredible non-games too. |
|||
|
|
|
08-03-2022, 01:37 AM
Post: #7
|
|||
|
|||
RE: The sophisticated HP-65
(08-03-2022 12:08 AM)Gene Wrote: what? you don't have the PDF copies of all those issues? - it's on the HHC conference drive and Jake Schwartz sells the scans cheap!Better, I have the original paper version .... oouuuu! LOL Gene is absolutely right, Jakes thumb drive is a must have → PPC Archive V2.41, April 1, 2022 |
|||
|
|
|
08-03-2022, 06:42 AM
(This post was last modified: 08-03-2022 06:43 AM by C.Ret.)
Post: #8
|
|||
|
|||
RE: The sophisticated HP-65
(08-02-2022 08:30 PM)Thomas Klemm Wrote: FYI: There are some inconsistencies between the numeric codes and their textual representations.Thank you for the link to a very useful online emulator, the careful reading of my post and especially for pointing out inconsistencies. I have to change my practice when posting; copying and pasting my code from an emulator or a quality simulator will avoid the far too many errors and typos I made up to now! I'm updating all of this... |
|||
|
|
|
08-03-2022, 02:46 PM
Post: #9
|
|||
|
|||
|
RE: The sophisticated HP-65
Cramming the N-Queens benchmark into 100 steps and no indirect addressing is probably the tightest fit I've pulled off.
(Also see the link at the bottom of that thread where Thomas Klemm managed to make it work on the 25!) |
|||
|
|
08-03-2022, 04:18 PM
Post: #10
|
|||
|
|||
RE: The sophisticated HP-65
(08-02-2022 11:22 PM)Don Shepherd Wrote: prime factor finder Here's a listing of the program that can be used with this online emulator for the HP-65: Code: 001: 23 : LBLExample 11111 C 41.00 R/S 271.00 R/S 0.00 Performance Question Maybe someone with a better understanding of the internals of the HP-65 can answer the following question: Would it make sense to invert the order of the three sections A, B and C since e.g. B is calling A often? This is the reordered program: Code: 001: 23 : LBLA single test using 11113 with the emulator would indicate this. |
|||
|
|
|
08-03-2022, 04:32 PM
Post: #11
|
|||
|
|||
RE: The sophisticated HP-65
(08-03-2022 02:46 PM)Dave Britten Wrote: Cramming the N-Queens benchmark into 100 steps and no indirect addressing is probably the tightest fit I've pulled off. Again a listing of the program that can be used with this online emulator for the HP-65: Code: 001: 33 05 : STO 5 |
|||
|
|
|
08-03-2022, 04:49 PM
Post: #12
|
|||
|
|||
| RE: The sophisticated HP-65 | |||
|
|
|
08-03-2022, 06:13 PM
(This post was last modified: 08-03-2022 06:54 PM by C.Ret.)
Post: #13
|
|||
|
|||
|
RE: The sophisticated HP-65
No problem...
My project is to continue to illustrate the listing of my programs with as much information as possible to understand the ins and outs, the methodology and how it all comes together. But, I still will try when possible to copy-paste the codes and mnemonics from an emulator or a simulator. This will limit errors (too many for my taste) due to inattentive transcriptions of my notes. Especially when I compose the program by improving it on a real machine. I agree, color and layout are of great importance and cannot be changed, a lot of documentation here follows the same style. To illustrate: |
|||
|
|
|
01-22-2024, 05:21 PM
Post: #14
|
|||
|
|||
RE: The sophisticated HP-65
(08-01-2022 10:12 PM)Matt Agajanian Wrote: Even with 100 semi-merged steps and nine (eight if you’re using functions that need R9), the HP-65 can definitely be a strong programmable. It's not just 100 steps as this is a mag card programmable; a virtual machine. Better to ask how many cards were used. As for me it's a 4 card set to solve the Barrowman Equations. -J |
|||
|
|
|
01-22-2024, 06:11 PM
Post: #15
|
|||
|
|||
|
RE: The sophisticated HP-65
A couple interesting relevant points:
I had several programs accepted into the 'HP65 Users Library' back in the day. Also, while in a numerical methods class (in the days of Fortran IV on an IBM1130 mainframe), we had a 'drag race' with my HP65 for estimating Pi via inscribed and circumscribed polygons. While not a particularly sophisticated program, it uncovered the numerical accuracy superiority of the precision of the HP65 compared to Fortran of 1975 (I do not recall if I used single or double precision). After this experiment, my Mathematics and Engineering profs ceased making fun of me carrying and using that expensive 'toy'! TomC (08-01-2022 10:12 PM)Matt Agajanian Wrote: Even with 100 semi-merged steps and nine (eight if you’re using functions that need R9), the HP-65 can definitely be a strong programmable. |
|||
|
|
|
01-23-2024, 02:16 AM
Post: #16
|
|||
|
|||
RE: The sophisticated HP-65
(01-22-2024 05:21 PM)John Garza (3665) Wrote:(08-01-2022 10:12 PM)Matt Agajanian Wrote: Even with 100 semi-merged steps and nine (eight if you’re using functions that need R9), the HP-65 can definitely be a strong programmable. Definitely ambitious!! |
|||
|
|
|
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 3 Guest(s)