Groups
Sign in
Groups
Nashville Functional Programmers
Conversations
About
Send feedback
Help
Chat from tonight's meeting
10 views
Skip to first unread message
Mark Wutka
unread,
Feb 27, 2024, 9:32:01 PM
Feb 27
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to nashfp
19:44:15 From Jason Orendorff To Everyone:
A big theta looks like this: Θ
19:45:41 From Jason Orendorff To Everyone:
https://mitpress.mit.edu/9780262045308/ideas-that-created-the-future/
19:50:30 From Jason Orendorff To Everyone:
https://en.wikipedia.org/wiki/Perceptron
19:50:39 From Mark Wutka To Everyone:
https://home.csulb.edu/~cwallis/382/readings/482/mccolloch.logical.calculus.ideas.1943.pdf
19:51:52 From Scott To Everyone:
https://explainextended.com/2023/12/31/happy-new-year-15/
19:52:51 From Scott To Everyone:
Above link is ChatGPT via sql
19:53:00 From Jason Orendorff To Everyone:
This activation function, ReLU, was I think the first “good” activation function; IIRC the paper didn’t make a big splash at the time. It made deep learning practical.
https://www.cs.toronto.edu/~fritz/absps/reluICML.pdf
19:58:45 From Alden To Everyone:
Syntax Question: What is the `=>` operator in mana?
20:31:51 From Jason Orendorff To Everyone:
Koka:
https://koka-lang.github.io/koka/doc/index.html
20:35:48 From Scott To Everyone:
I have to run to a school function — but this was really impressive Mike! Thanks!
20:44:27 From Jason Orendorff To Everyone:
https://wiki.portal.chalmers.se/agda/ReferenceManual/Totality
20:45:21 From Jason Orendorff To Everyone:
“Not all recursive functions are permitted - Agda accepts only these recursive schemas that it can mechanically prove terminating.“
20:47:55 From Jason Orendorff To Everyone:
Brb reserving "
dolthub.com
"
20:54:13 From Jason Orendorff To Everyone:
It seems really hard to have the compiler detect when a closure has closed over an “IO”, in order to force it to be declared… for example, say a closure closes over a generic `T`, you don’t know yet if that’s an IO, or maybe something that contains an IO
21:07:56 From Mark Wutka To Everyone:
Should have put this in the chat earlier:
Nerves Conf on May 9 in Chattanooga
Gig City Elixir May 10-11 in Chattanooga, at least three NashFP folks will be speaking there
21:11:25 From Mark Wutka To Everyone:
https://github.com/gunnarmorling/1brc
21:12:23 From Flora Petterson (she/her) To Everyone:
https://www.meetup.com/nerves/events/298253592/
21:12:31 From Grantly Neely To Everyone:
GitHub: GraniteEducation
21:12:37 From Flora Petterson (she/her) To Everyone:
Nerves online meetup tomorrow night
21:13:54 From Alden To Everyone:
me too plz for github: @alden-neely
21:14:50 From Mike K To Everyone:
https://github.com/microsoft/DirectStorage
21:18:26 From Mike K To Everyone:
https://galaxy.opensyllabus.org/
21:18:47 From Cliff Anderson To Everyone:
https://www.coursera.org/learn/programming-for-a-networked-world
21:19:04 From Mike K To Everyone:
https://explorer.globe.engineer/?q=lambda+calculus
21:22:17 From Mark Wutka To Everyone:
https://archive.org/details/mad-potrzebie-measurement-system-mad-033/mode/2up
21:26:42 From Mike K To Everyone:
https://webglsamples.org/aquarium/aquarium.html
Reply all
Reply to author
Forward
0 new messages