Patricia Ferreira <
pferreira@example.com> writes:
yeti <yeti@tilde.institute> writes:
|\/| _ _ _ _ _ | | |
| |(_)(_)(_)| | | . . .
I'm hallucinating and still see Patricia here...
;-)
LOL! That was not a lie---but I changed my mind and killed all groups
and left this one. What was annoying me was that I had subscribed to a
lot of groups and they're all quiet, so I wanted to just go away. But
I'll keep this one just to chat with you.
Oh ... nice ... but being one of many here would even be nicer.
Dude, you gotta use a Lisp that doesn't require you to run emacs to
compute it. I wonder why the EMACS people didn't release an interpreter
or compiler outside of the GNU EMACS. I think that would be healthy to
the GNU EMACS community.
Emacs can be started as s script interpreter without staring all the UI
parts, but that doesn't change it's capabilities and I'd perfer a
"smaller" Lisp that compiles to C and/or has a good FFI. Systems that
ignore that layer feel like a wart on a Unix. I see Elisp only in the
context of extending Emacs and especially nice helpers in Org/Babel. So
I'll give other Lisps the next chance when I'm confident that they will
not confuse me when using Elisp in Org/Babel.
...aaaaand there is the Lisp used in Sawfish (Rep) which claims to be
like Elisp. I never used it outside of Sawfish, but configuring that WM
via Lisp was not a big problem even after not having touched Lisp for
decades. I played with Sawfish round about the Debian6-to-7 upgrade
era.
<
http://sawfish.tuxfamily.org/> <
http://sawfish.tuxfamily.org/librep.html/index.html>
E.g. in that experiment where I collect code snippets that all shall
produce the same output and suppress the output unless it does not match
the expected results.
<http://yeti.freeshell.org/brain/unsorted.d/compare-results.org> \\
<http://yeti.freeshell.org/brain/unsorted.d/compare-results.html>
Hey, you're interested in numbers. Cool. I just proved the fundamental theorem of arithmetic (after proving Euclid's Lemma).
-----------------------------------------------------------------------
3. Hitchhiker 1: (6) He stood up straight and looked the world squarely
in the fields and hills. To add weight to his words he stuck the rabbit
bone in his hair. He spread his arms out wide. (7) "I will go mad!" he announced. -----------------------------------------------------------------------
Primes drive me mad. In a positive way.
I had an overdose of university maths and forgot most of it. I still occasionally like to do weird things with and without maths. Sometimes
it is just comparing code snippets in multiple languages like an own
little Rosetta Code, sometimes numbers or maths are more in the
spotlight than the languages.
Short form: I loved maths until the university destroyed that and now
I only play a bit with it.
The last fun I hat was "transposing" a prime number algorithm I made
years ago by "pulling the sieve of Eratosthenes through a Klein's
bottle" to using unary numbers in plain SH. If run open ended normally
the original sieve would need to nest infinite loops, and I just
reordered that to a more sequential way. That needs storage and
original SH lacks arrays, but you can fake them by constructing variable
names like S$SOMENUMBER. Combined with an unary number representation
that then was kind of funny.
Best Klein's bottle clip:
<
https://www.youtube.com/watch?v=cdLXvJ8wFY4>
So basically I translated this Python2 snippet to SH without BASH or ZSH blingbling:
------------------------------------------------------------------------ #!/usr/bin/env python
#
# floating (sliding?) sieve of eratosthenes prime number generator #==================================================================
#
# 2011-09-12, yeti
#
L = {}
n = 2
while 1:
if n in L:
P = L[n]
del L[n] # optional - saves some memory.
else:
P = n
print n
m = n+P
while m in L:
m += P
L[m] = P
n += 1
----------------------------------------------------------
This way all action happens at a hotspot of the number line plus
maximally a distance in which the already known primes jump around like
frogs on a one dimensional playing field and they jump by the distance
of their own value. Or boring: Just another serialisation of the
original sieve. Getting it done in SH was the hurdle because I never
used SH's eval function before. Somehow KSH, BASH and other shells had
all the blingbling that made fighting with eval unnecessary, lile
${!name} for indirect references.
And than unary did bite me again, I turned the 1st mess I used in the
primes example into some functions, added whole numbers as pairs of
credit and debit (C.D) to avoid an explicit zero and then fractions as
pairs of a whole number as numerator N and a natural number as scale S
(wanted to avoid denumerator as name because I already used D for debit)
N:S = C.D:S.
Guess what... I added enough functions to theoretically calculate a
Mandelbrot set in unary fractions, but it turned out that the size of
the unary number's representations would blow up every swap size I can
provide.
Ok. Hit shappens! But it was worth it.
Looking at the whole numbers C.D and the operation to reduce them to a representation where the bigger part is reduced by the amount of the
other one (subtract the "greatest common subtractor") that was so
similar to trimming down quotients by dividing away the GCD, that I
smiled for days over that analogy.
That alone was worth it and compensated well for not getting a purely
unary calculated Mandelbrot set image.
Lisp is great and it's not too far away from Elisp. (I loved it.)
Maybe I'll get there later.
--
I'm nonbinary, I use Lisp and Scheme. -- 20240301/yeti
--- Synchronet 3.19b-Linux NewsLink 1.113