Published as: arxiv.org/pdf/2304.03442.pdf Generative Agents: Interactive Simulacra of Human Behavior by Park et al.
The financial industry does not serve society nowhere near its magnitude (London of course being the epitome of that). It serves only itself. It just grows without bound.
- www.theatlantic.com/technology/archive/2011/05/on-the-floor-laughing-traders-are-having-a-new-kind-of-fun/238570/ On the Floor Laughing: Traders Are Having a New Kind of Fun (2011) by James Somers describes trading as a kind of game.
Why I chose quant trading to retire early by Lit Nomad
. Source. Ciro Santilli was not sure under which section classify this video. It is worthwhile despite the title- youtu.be/exPt6mVgpfY?t=123 describes how at Lockheed Martin they were playing the "we are doing it for national defense, not for money card" on employees. Ciro Santilli came to understand and despise similar hypocrisy via Ciro's everyone gets a raise story
The GAN paper itself does a bit of this, cool hello world:
Larry Page's father.
Carl is mentioned in The Google Story Chapter 2 "When Larry Met Sergey".
He divorced from Larry's mother Gloria in 1980 or 1981, "when he [Page] was eight years old" according to The Google Story. He then moved on to Joyce Wildenthal, another MSU professor. Larry had a good relation with both Gloria and Joyce:
Larry came to feel that he was showered with love and wisdom from two mothers: his real mom, and Joyce Wildenthal, a Michigan State professor who had a long-term relationship with his dad.
His obituary on the website of the Michigan State University, where he taught most of his life: www.cse.msu.edu/Alumni_Friends/Alumni/PageMemorial.php:
Page served as CSE’s [MSU Department of Computer Science and Engineering] first graduate director and had a critical role in promoting the department’s research mission. In 1967, when he joined MSU, the computer science program consisted of only undergraduate courses. Just three years later, the department offered eighteen graduate courses in computer science.[...]Page taught courses in Automata and Formal language theory and Artificial intelligence. He was a beloved teacher and mentor to innumerable students until his death in 1996.
Carl Victor Page's obituary by Matt Collar
. Source. 
Presumably printed on the The State News, student newspaper of the Michigan State University.
Found by Googling into his Wikidata entry: www.wikidata.org/wiki/Q15791098 which cites this random German Wikipedia page: de.wikipedia.org/wiki/Carl_Victor_Page which cites the obituary from this WordPress blog: tao221.wordpress.com/ TODO find the page of the blog that uses that image.
Carl Victor Page Memorial World Wide Web Page
. Source. Another useful hit from tao221.wordpress.com found by... Googling! Contains the best photo of Carl we've found so far. The screenshot seems to be a Ctrl + P of some website, if only the author knew about Wayback Machine! The links on that screenshot would be of interest. The screenshot also mentions other family members:
- Carl B. Page, with a cpsr.org/ email. A brother maybe? www.legacy.com/us/obituaries/detroitnews/name/carl-page-obituary?pid=182235576%26utm_source%3Dfacebook%26utm_medium%3Dsocial%26utm_campaign%3Dobitsharebeta mentions a Carl B. Page from Michigan who died in 2010.
- Joyce Wildenthal, Carl's partner, with a pilot.msu.edu email. TODO what is
pilot?
Original paper: Section "GAN paper".
In intuitive terms it consists of all integer functions, possibly with multiple input arguments, that can be written only with a sequence of:and such that
- variable assignments
- addition and subtraction
- integer comparisons and if/else
- for loops
for (i = 0; i < n; i++)n does not change inside the loop body, i.e. no while loops with arbitrary conditions.n does not have to be a constant, it may come from previous calculations. But it must not change inside the loop body.Primitive recursive functions basically include every integer function that comes up in practice. Primitive recursive functions can have huge complexity, and it strictly contains EXPTIME. As such, they mostly only come up in foundation of mathematics contexts.
The cool thing about primitive recursive functions is that the number of iterations is always bound, so we are certain that they terminate and are therefore computable.
This also means that there are necessarily functions which are not primitive recursive, as we know that there must exist uncomputable functions, e.g. the busy beaver function.
Adding unbounded while loops of course enables us to simulate arbitrary Turing machines, and therefore increases the complexity class.
More finely, there are non-primitive total recursive functions, e.g. most famously the Ackermann function.
Pinned article: ourbigbook/introduction-to-the-ourbigbook-project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivative - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.
Figure 3. Visual Studio Code extension installation.
Figure 4. Visual Studio Code extension tree navigation.
Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.Video 4. OurBigBook Visual Studio Code extension editing and navigation demo. Source. - Internal cross file references done right:
- Infinitely deep tables of contents:
Figure 6. Dynamic article tree with infinitely deep table of contents.Live URL: ourbigbook.com/cirosantilli/chordateDescendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact