“Computability Theory”, Marks (2024)

Prof. Marks wrote this little pamphlet on #computability theory for his undergraduate #CS course at #Berkeley. This publication gives a fairly comprehensive coverage of computability in just 100 pages. So, it is not suitable for use by students as a self-study guide. But it is superb for use by an instructor as teaching notes.

https://math.berkeley.edu/~marks/notes/computability_notes_v1.pdf

#AI robbed #IT corporate jobs and dropped #CS college enrolment.

https://youtu.be/4IHMbvc21Nw?si=Y45f7aE_4ijoFzu-

AAAI-2026 参加報告
https://developers.cyberagent.co.jp/blog/archives/62979/

#developers #エンジニア #株式会社AI_Shift #AIShift #AI #人工知能 #Chat #カスタマー #CS

CS folks: I have a bit of extra professional development funds and am looking to buy some good books.

What are some of your all-time favorite books related to CS, programming, and so on? (For me, I might mention "On Lisp", and "Algorithms to Live By")

I'm especially interested in books on CS and philosophy, or CS and art. (Those should "keep" longer than, say, your bog-standard O'Reilly-style book on programming Rust, since that language will keep evolving. But, if there is one of those that's really good, do recommend it.)

Feel free to spill over in to more math-y topics -- discrete math, combinatorics, and such.

#hivemind #cs #bookstodon

I'm looking for an algorithm that probably has a name but I don't know what it is.

You have a bunch of text files, which you split into words somehow. You want to compile a list of all the *unique* words across all the files and store this list as *compactly* as possible. For example: input ["a", "a", "ab"], output { store: "ab", index: [(0,1), (0,2)] }.

I know how to do this in quadratic time and O(1) extra space, assuming a O(m+n) string search primitive. Can one do better?

#cs #algorithms

small maurice nivat bio can be found on here

https://web.archive.org/web/20050205084419/http://www.pps.jussieu.fr/~curien/

#EACTS #lip #iria #inria #cs

Liebe Freunde fantastischer Flicks, hervorragender Headshots und brutalen Bomb-Placements,

um 20:00 Uhr gibt's unser Team

Munich eSports Mars gegen die Ostblock Allstars

live und in Farbe auf unserem Channel

https://www.twitch.tv/munich_esports/ - bis gleich!

#CS #CS2 #TwitchDE #PlayYourHeartOut #Gaming #esports #München #DACHCSMasters