Recent searches

No recent searches

Search options

Only available when logged in.
techhub.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A hub primarily for passionate technologists, but everyone is welcome

Administered by:

Server stats:

4.6K
active users

techhub.social: AboutStatusProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.1

#compsci

3 posts3 participants0 posts today
José A. Alonso<p><a href="https://mathstodon.xyz/tags/MULCIA" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MULCIA</span></a>: Postdoc in AI (including logic), University of Bergen (Norway). <a href="https://tinyurl.com/2237r8xo" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/2237r8xo</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/PostDoc" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PostDoc</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://mathstodon.xyz/tags/AI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AI</span></a></p>
José A. Alonso<p>Readings shared July 18, 2025. <a href="https://jaalonso.github.io/vestigium/posts/2025/07/19-readings_shared_07-18-25" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">jaalonso.github.io/vestigium/p</span><span class="invisible">osts/2025/07/19-readings_shared_07-18-25</span></a> <a href="https://mathstodon.xyz/tags/ACL2" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ACL2</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> <a href="https://mathstodon.xyz/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a> <a href="https://mathstodon.xyz/tags/LLMs" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LLMs</span></a> <a href="https://mathstodon.xyz/tags/LeanProver" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LeanProver</span></a> <a href="https://mathstodon.xyz/tags/Rocq" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rocq</span></a> <a href="https://mathstodon.xyz/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rust</span></a> <a href="https://mathstodon.xyz/tags/Teaching" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Teaching</span></a></p>
Lobsters<p>Super Mario Bros is (Computationally) Hard <a href="https://lobste.rs/s/pz8p8c" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/pz8p8c</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/video" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>video</span></a> <a href="https://mastodon.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a> <a href="https://mastodon.social/tags/games" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>games</span></a><br><a href="https://www.youtube.com/watch?v=unLPk4H1hto" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="">youtube.com/watch?v=unLPk4H1hto</span><span class="invisible"></span></a></p>
Lobsters<p>How do you compute the midpoint of an interval? (2014) <a href="https://lobste.rs/s/t8dsm3" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/t8dsm3</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/pdf" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>pdf</span></a> <a href="https://mastodon.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a><br><a href="https://hal.science/file/index/docid/576641/filename/computing-midpoint.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">hal.science/file/index/docid/5</span><span class="invisible">76641/filename/computing-midpoint.pdf</span></a></p>
Papers We Love<p>📜 The Derivative of a Regular Type is its Type of One-Hole Contexts [2001]</p><p>By: Conor McBride</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/languages-theory/the-derivative-of-a-regular-type-one-hole-contexts.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/languages-theory/the-derivative-of-a-regular-type-one-hole-contexts.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/4286bcc299ab34b0581cbd62d6241794fc9052de" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/4286</span><span class="invisible">bcc299ab34b0581cbd62d6241794fc9052de</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
José A. Alonso<p>Teaching software specification (Experience report). ~ Cameron Moy, Daniel Patterson. <a href="https://ccs.neu.edu/~camoy/pub/lsl.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">ccs.neu.edu/~camoy/pub/lsl.pdf</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://mathstodon.xyz/tags/Teaching" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Teaching</span></a> <a href="https://mathstodon.xyz/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a> <a href="https://mathstodon.xyz/tags/LeanProver" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LeanProver</span></a> <a href="https://mathstodon.xyz/tags/ACL2" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ACL2</span></a></p>
José A. Alonso<p>CSLib: An open-source Lean 4 library formalizing a significant subsetof undergraduate-level computer science. ~ Clark Barrett et als. <a href="https://docs.google.com/presentation/d/1aJFM3EaI4LcppHR_2YFQHiBjUfMMhMKxCeM3BfINi48" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">docs.google.com/presentation/d</span><span class="invisible">/1aJFM3EaI4LcppHR_2YFQHiBjUfMMhMKxCeM3BfINi48</span></a> <a href="https://mathstodon.xyz/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a> <a href="https://mathstodon.xyz/tags/LeanProver" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LeanProver</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a></p>
José A. Alonso<p><a href="https://mathstodon.xyz/tags/MULCIA" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MULCIA</span></a>: Applied researcher in formal methods (Lean4) at Axiomatic_AI. <a href="https://tinyurl.com/ylsqbu6e" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/ylsqbu6e</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/Jobs" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Jobs</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://mathstodon.xyz/tags/LeanProver" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LeanProver</span></a></p>
Lobsters<p>Iris-WebP: Fast, efficient WebP encoder by <span class="h-card" translate="no"><a href="https://disobey.net/@gianni" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>gianni</span></a></span> <a href="https://lobste.rs/s/qckjst" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/qckjst</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a> <a href="https://mastodon.social/tags/web" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>web</span></a><br><a href="https://halide.cx/iris" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">halide.cx/iris</span><span class="invisible"></span></a></p>
Ryan<p>Anyone have suggestions on a "breadth instead of depth" type book for Computer Science?</p><p>I've been a pragmatic coder for a decade and run into all sorts of useful tools and concepts, but I would love exposure to as many as possible!</p><p>For instance, I just recently learned about Bloom filters. They just never came across my radar. </p><p><a href="https://hachyderm.io/tags/webdev" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>webdev</span></a> <a href="https://hachyderm.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a> <a href="https://hachyderm.io/tags/softwareengineering" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>softwareengineering</span></a></p>
Lobsters<p>Introduction to the Par Language via <span class="h-card" translate="no"><a href="https://mathstodon.xyz/@4ad" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>4ad</span></a></span> <a href="https://lobste.rs/s/22rvk3" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/22rvk3</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a> <a href="https://mastodon.social/tags/plt" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>plt</span></a><br><a href="https://faiface.github.io/par-lang/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">faiface.github.io/par-lang/</span><span class="invisible"></span></a></p>
Joshua Grochow<p>Has anyone played around with encouraging (but not requiring) students to teach one another?</p><p>One way of demonstrating mastery of the material is teaching it to others. I feel like if student A says "Student B really helped me understand the material" that increases my Bayesian posterior that student B understood the material really well (and also that student A understood it, since presumably after student B explained it, student A understood it at least better than they did before).</p><p>I wouldn't do this as the only, or even major, part of their grade, but it seems like if the grade is to reflect learning, that teaching it to others certainly reflects on their learning.</p><p>(Additional context: this is for a university-level elective technical course in Comp Sci, for 3rd and 4th-years mostly. I generally do flipped classroom and alternative grading - some combo of ungrading, mastery-based, standards-based, but I'm open to ideas. The class has about 55 students, so whatever it is can take some time but not be *too* time-intensive on me &amp; the one TA.)</p><p><a href="https://mathstodon.xyz/tags/AlternativeGrading" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AlternativeGrading</span></a> <a href="https://mathstodon.xyz/tags/grading" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>grading</span></a> <a href="https://mathstodon.xyz/tags/teaching" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>teaching</span></a> <a href="https://mathstodon.xyz/tags/education" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>education</span></a> <a href="https://mathstodon.xyz/tags/CSEd" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CSEd</span></a> <a href="https://mathstodon.xyz/tags/ComputerScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputerScience</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a></p>
Lobsters<p>Improving AVIF in Open Source by <span class="h-card" translate="no"><a href="https://disobey.net/@gianni" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>gianni</span></a></span> <a href="https://lobste.rs/s/hvo6lf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/hvo6lf</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a><br><a href="https://halide.cx/blog/improving-avif-in-open-source/index.html" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">halide.cx/blog/improving-avif-</span><span class="invisible">in-open-source/index.html</span></a></p>
José A. Alonso<p><a href="https://mathstodon.xyz/tags/MULCIA" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MULCIA</span></a>: Doctoral/Postdoctoral Position in Formal Methods and Verification, Konstanz (Germany). <a href="https://tinyurl.com/ysyqy3g5" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/ysyqy3g5</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/PhD" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PhD</span></a> <a href="https://mathstodon.xyz/tags/PostDoc" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PostDoc</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a></p>
José A. Alonso<p><a href="https://mathstodon.xyz/tags/MULCIA" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MULCIA</span></a>: 2 Postdoc Positions in Homotopy Type Theory, University of Nottingham (UK). <a href="https://tinyurl.com/ysld3f5r" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/ysld3f5r</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/PostDoc" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PostDoc</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a></p>
José A. Alonso<p><a href="https://mathstodon.xyz/tags/MULCIA" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MULCIA</span></a>: PhD positions in formal methods and planning, Gothenburg (Sweden) <a href="https://tinyurl.com/ywa5vee6" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/ywa5vee6</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/PhD" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PhD</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a></p>
Papers We Love<p>📜 Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web [1997]</p><p>By: D. Karger, E. Lehman, F. Leighton, et al.</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/consistent-hashing-and-random-trees.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/distributed_systems/consistent-hashing-and-random-trees.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/02bb762c3bd1b3d1ad788340d8e9cdc3d85f33e1" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/02bb</span><span class="invisible">762c3bd1b3d1ad788340d8e9cdc3d85f33e1</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Charo del Genio<p>New paper!<br>How can we detect the presence of communities in networks with higher-order interactions? For instance, by maximizing hypermodularity! Also, this formulation will allow you to leverage tensor spectral methods to do it. Additionally, the paper also argues that the "overfitting" of modularity methods is actually just people applying them where they are not supposed to be used. And, as a byproduct, there is an explanation of why higher-order SVD works so well in classification tasks in machine learning. Oh, the code is available to use in your own projects (link in the first comment). And moreover, the code includes an efficient data structure for higher-order networks that is independent from the community detection method and that you can also use in your own work. 😎</p><p><a href="https://journals.aps.org/prresearch/abstract/10.1103/58dr-wktc" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">journals.aps.org/prresearch/ab</span><span class="invisible">stract/10.1103/58dr-wktc</span></a></p><p><a href="https://mathstodon.xyz/tags/networks" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>networks</span></a> <a href="https://mathstodon.xyz/tags/complexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>complexity</span></a> <a href="https://mathstodon.xyz/tags/physics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>physics</span></a> <a href="https://mathstodon.xyz/tags/maths" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>maths</span></a> <a href="https://mathstodon.xyz/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://mathstodon.xyz/tags/graphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>graphs</span></a> <a href="https://mathstodon.xyz/tags/higherorder" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>higherorder</span></a> <a href="https://mathstodon.xyz/tags/hypergraphs" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>hypergraphs</span></a> <a href="https://mathstodon.xyz/tags/community" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>community</span></a> <a href="https://mathstodon.xyz/tags/detection" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>detection</span></a> <a href="https://mathstodon.xyz/tags/algorithm" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>algorithm</span></a> <a href="https://mathstodon.xyz/tags/communitystructure" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>communitystructure</span></a> <a href="https://mathstodon.xyz/tags/modularity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>modularity</span></a> <a href="https://mathstodon.xyz/tags/hypermodularity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>hypermodularity</span></a></p>
cst1<p><span class="h-card" translate="no"><a href="https://a.gup.pe/u/academicchatter" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>academicchatter</span></a></span> </p><p>Okay, what tools would you recommend using to help order, browse, visualize and expand your research library? </p><p>I'm using Zotero as the backing library manager + <a href="https://researchrabbitapp.com/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">researchrabbitapp.com/</span><span class="invisible"></span></a> for the visualization/discovery part but open to suggestions and tips!</p><p><a href="https://chaos.social/tags/academia" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>academia</span></a> <a href="https://chaos.social/tags/phd" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>phd</span></a> <a href="https://chaos.social/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://chaos.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Vladimir Savić<p>Computer scientists figure out how to prove lies <a href="https://www.quantamagazine.org/computer-scientists-figure-out-how-to-prove-lies-20250709/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">quantamagazine.org/computer-sc</span><span class="invisible">ientists-figure-out-how-to-prove-lies-20250709/</span></a></p><p>N.B. Direct link to actual paper <a href="https://eprint.iacr.org/2025/118" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">eprint.iacr.org/2025/118</span><span class="invisible"></span></a> </p><p><a href="https://mastodon.social/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://mastodon.social/tags/security" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>security</span></a> <a href="https://mastodon.social/tags/cryptology" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>cryptology</span></a></p>
TrendingLive feeds
About