Anonymous user
User talk:PureFox: Difference between revisions
m
→your (Go) comments about unprimeable goals: added some comments.
(Replied to Gerard.) |
m (→your (Go) comments about unprimeable goals: added some comments.) |
||
Line 151:
::Haven't come across that word before which looks to be of Greek origin. I'll have to try and build it into my Go examples - make a change from emojis :) --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 10:40, 30 November 2019 (UTC)
== your (Go) comment about the unprimeable task's goals ==
I had thought of making some optional requirements (for extra credit or whatever), but I thought what I eventually come up with was challenging (tough) enough. I based this on how long me and my REXX program had to struggle with the (somewhat fast) testing for primeness, and other concerns. (How I wish REXX had a BIF for testing for primeness: an '''isPrime''' function). That would've made the job of creating a new and respectively moderate Rosetta Code task a lot easier, and also judging how easy (programming wise) a task should be (say, for most computer programming languages, if not all). I won't embarrass myself on how long I labored on this task; one problem was in the wording of the (or should I say, '''a''') definition. I used '''a''' version that didn't mention that the number had to be composite, and I stumbled into also generating '''weaker''' primes (not to be confused with '''weak''' primes). This didn't show up until I stress tested the REXX program in searching for higher unprimeable numbers, and I just ''could not'' figure out where the problem was. This lead to a loss of even more hair (that I can't afford to lose by pulling it out). Thank gawd that I had a source that I could reference which had more unprimeable numbers listed and I deduced where the error lay. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:50, 1 December 2019 (UTC)
By the way, when I can't see through the fog of some Rosetta Code task's requirements (or algorithms), my first go-to is '''PL/I''', which normally is not present, but has the closest syntax to '''REXX'''. My first major computer programming language was '''FORTRAN''' (back when it was all caps), my second language was '''PL/I'''. I can hardly recognize '''Fortran''' code anymore. My third language was GPSS (used for simulation of such things as bank teller queues, highway traffic, planes landing/taking off, etc. I practically melted my brain in trying to program various scenarios. All ya do is describe the queue and how people (or things) react, and "it" magically tells ya what ya want (or need) to know. ... Any-a-ways ... My second go-to on RC is '''Go''' (a proper and fitting name for a programming language in this case), it usually is the (for me) the clearest to understand. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:50, 1 December 2019 (UTC)
I think I should take a respite from working on Rosetta Code (et al), it seems a way bit too toxic at this point, and I have other hobbies to tend to. (Never argue with someone who buys ink by the barrel). I have an extensive library of over 2,500 railroad books (and some steam books), and it's index (descriptions, contents, bibliography, description of the book, ...) needs a bit of loving attention before it hopefully finds a new home in some RR museum. I might as well as labor on something that I enjoy and gives me bliss. Lately, it's been like pushing a chain up hill with Rosetta Code (cosmetic updates for readability, esthetics, and clarity). There's way too much ego to contend and hassle with. My other labor of love is a fancy-dancy, slicer-dicer, all-in-one (interactive, command-line) calculator that has over 1,500 functions in it, and also includes plotting (X, X/Y scatter plots, vertical and horizontal histograms, also supports plotting to all types of terminals/consoles/printers), multiple-argument functions (very much like APL), and many forms of columnar displaying of the output. Just the documentation (which is quite abbreviated) is over twenty thousand lines. I've been borrowing stuff from it for almost all of my various Rosetta Code tasks (that're appropriate for this site). Only a couple of thousand to go (just teasing). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:50, 1 December 2019 (UTC)
Also, by the way, thanks for finding an oversight of mine concerning the ''unprimeable'' task ('''25''' vs. '''35'''). Another case of not seeing the obvious. It was at one time, '''25''', and I changed it to '''35''', but the change was done on my other computer, and it never crossed over (walked over by using a USB stick) to my "work" computer. My other computer is an air-gap computer, a virgin (by internet standards). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:50, 1 December 2019 (UTC)
| |||