https://www.europesays.com/3354300/ Quantifying the human visual exposome with vision language models #COMPUTERSCIENCE #Environment #EnvironmentalSciences #general #psychology

Yet another book worth reading.
And more than once!

Frederick P. Brooks, Jr.
The Design of Design
Essays from a Computer Scientist
(2010)

«Front Cover: John Constable’s design (painting) for his view of Salisbury Cathedral, the design of Elias de Dereham and Nicholas of Ely.»
Needless to say, Constable was a master of detail as well.
There are three people and four cows in the foreground.
One thing about them is that the cows are more prominent 🙂.

#ComputerScience
#Design
#MetaDesign
#SoftwareEngineering

Alt...

The front cover of the book, as described in the post. The top carries the text “From the author of _The Mythical Man-Month_”. The cathedral in the picture is well lit by the sun and has a tower with a very tall spire. The foreground is shaded and also includes a meadow, a large puddle, and trees.

#ComputabilityTheory is the foundation of #ComputerScience. It is a concept that #CS folks know they do not grasp fully but #IT coders believe they know well.

#LunchtimeLament

We interrupt your regular scheduled programming for a #ACMCoffeeBreakPuzzle. You might have to take out a pencil and paper for this one. 😉 🔗 here for more: https://www.acm.org/education/coffee-break-puzzles

#computerscience
#puzzle
#math
#graphtheory

In _Anatomy of LISP_, John Allen introduces continuations in Chapter 4, Imperative Constructs in LISP, section 4.7, `eval’ with Explicit Control.
This helped me a lot to understand continuations back when I first read that book.

He writes:
«We now propose to explicitly *pass along* information about what to do after the current computation is completed.
This information is called the *continuation*.»

In the implementation shown, a continuation is a function supplied as the sole parameter `c’ of function `ceval’, the evaluator; `c’ is also a non-local variable in auxiliary function `ev1’.
The whole evaluation algorithm works with a tad of higher-order mutually recursive wizardry.

Note: the bibliography includes two items related to the handling of non-local variables in the latter, though the book doesn't have explicit references to the first one.
Moses, J., ‘The Function of FUNCTION in LISP’, _SIGSAM Bulletin_, p. 13–27, July 1970.
Weizenbaum, J., ‘The FUNARG Problem Explained’, unpublished memorandum, M.I.T., Cambridge, Mass., 1968.

***

This book was published in 1978.
The algorithms in it are presented in the language of M-expressions (in my view, it is a purely algorithmic language, as distinct from a programming language).
Drawing a weak analogy, to me the exposition evokes texts on differential and integral calculus from the age of Leibniz, Newton, and Euler, before the transformations by Cauchy, Weierstrass, and others.

«About the Author
JOHN R. ALLEN is a member of the technical staff of the Hewlett-Packard Research Lab, Palo Alto, California.
After graduating from Michigan Technical University, he earned an M.A. degree from the University of California at Santa Barbara.
Mr. Allen did graduate work in computer science at Stanford University, where he was later a research associate.
He has taught at the University of California at Los Angeles and Santa Cruz, and at San Jose State.»

#ComputerProgramming
#ComputerScience
#Continuations
#Lisp

Alt...

The front cover of _Anatomy of LISP_ by John R. Allen. The graphic design is very simple: besides the title and the author’s name (on a white background), the only other elements are at bottom right, the words ARTIFICIAL INTELLIGENCE SERIES and a very stylized black silhouette of a human head with a white square inside.

Alt...

Page 208, showing the definitions of `ceval’, `ev1’, and `eval’.

Alt...

Page 209, showing the definitions of `ceval₁’, `ceval₂’, `ev2’, `ev3’, `ev4’, `ev5’, and `ev6’.

Rhizome Function Anagram Random Generator

preprint | https://zenodo.org/records/21551292

doi | https://orcid.org/0009-0009-5144-3278

Herein are described principles and a scheme of random number generation styled as, pangrandomonium, or ‘pangrand’. Pangrand is a anagrammatic random number generator that uses rhizome functions as chaotic indexing and shuffling instructions to reorder and sum perfect pangrams. Brief descriptions are given for the principles of pangram summing and rhizome indexing functions, Source code of the random number generator is included herewith. The source code is attached to the PDF file.

Sections:

1. Pangrams (Holoalphabetic arrays) ;
2. Rhizome Functions ;
3. Rhizome Hardness Problems ;
4. Random Generator Methods ;
5. Errata ;
6. Source Code.

#Preprints #Random #Cryptography #RNG #Pangrams #Anagrams #Pascal #Papers #RhizomeFunction #AcademicMastodon #Cryptology #Math #NumberTheory #Papers #Academia #ComputerScience #CompSci #AcademicChatter #OpenScience