Frühere Suchanfragen

Keine früheren Suchanfragen

Suchoptionen

Nur verfügbar, wenn angemeldet.
mastodontech.de ist einer von vielen unabhängigen Mastodon-Servern, mit dem du dich im Fediverse beteiligen kannst.
Offen für alle (über 16) und bereitgestellt von Markus'Blog

Verwaltet von:

Serverstatistik:

1,5 Tsd.
aktive Profile

mastodontech.de: ÜberStatusProfilverzeichnisDatenschutzerklärung

Mastodon: ÜberApp herunterladenTastenkombinationenQuellcode anzeigenv4.4.3

#compsci

5 Beiträge5 Beteiligte0 Beiträge heute
Wes Fryer<p>ChatGPT 5 finally rolled out to my Plus account overnight - I’m working on another <a href="https://triangletoot.party/tags/VibeCoding" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>VibeCoding</span></a> project with it. Impressed so far.</p><p>More: <a href="https://ai.wesfryer.com" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">ai.wesfryer.com</span><span class="invisible"></span></a></p><p><a href="https://triangletoot.party/tags/AI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AI</span></a> <a href="https://triangletoot.party/tags/edtechSR" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>edtechSR</span></a> <a href="https://triangletoot.party/tags/MediaLit" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MediaLit</span></a> <a href="https://triangletoot.party/tags/AIliteracy" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AIliteracy</span></a> <a href="https://triangletoot.party/tags/coding" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>coding</span></a> <a href="https://triangletoot.party/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>programming</span></a> <a href="https://triangletoot.party/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a></p>
Lobsters<p>Accidentally writing a fast SAT solver via <span class="h-card" translate="no"><a href="https://social.treehouse.systems/@RunxiYu" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>RunxiYu</span></a></span> <a href="https://lobste.rs/s/hcfzef" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/hcfzef</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://blog.danielh.cc/blog/sat" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">blog.danielh.cc/blog/sat</span><span class="invisible"></span></a></p>
Lobsters<p>Breaking the Sorting Barrier for Directed Single-Source Shortest Paths <a href="https://lobste.rs/s/hct5qg" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/hct5qg</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://arxiv.org/abs/2504.17033" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">arxiv.org/abs/2504.17033</span><span class="invisible"></span></a></p>
Papers We Love<p>📜 Spanner: Google's globally-distributed database [2013]</p><p>By: Brian F. Cooper</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/datastores/spanner-google's-globally-distributed-database.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/datastores/spanner-google's-globally-distributed-database.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/ec959da910873e8a39be67cfa2432683488b51a6" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/ec95</span><span class="invisible">9da910873e8a39be67cfa2432683488b51a6</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>
Lobsters<p>New Method Is the Fastest Way To Find the Best Routes <a href="https://lobste.rs/s/4fcgpi" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/4fcgpi</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://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">quantamagazine.org/new-method-</span><span class="invisible">is-the-fastest-way-to-find-the-best-routes-20250806/</span></a></p>
Lobsters<p>p-fast trie: lexically ordered hash map by <span class="h-card" translate="no"><a href="https://mendeddrum.org/@fanf" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>fanf</span></a></span> <a href="https://lobste.rs/s/b5a2ii" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/b5a2ii</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://dotat.at/@/2025-08-04-p-fast-trie.html" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dotat.at/@/2025-08-04-p-fast-t</span><span class="invisible">rie.html</span></a></p>
Lobsters<p>Destructive in-order tree traversal <a href="https://lobste.rs/s/sl0kea" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/sl0kea</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/c" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>c</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://morwenn.github.io//algorithms/2025/08/03/TSB002-destructive-inrder-tree-traversal.html" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">morwenn.github.io//algorithms/</span><span class="invisible">2025/08/03/TSB002-destructive-inrder-tree-traversal.html</span></a></p>
mirek kratochvil<p>Hey mathstodon,<br>is there please any formal review/refutation/validation of Trahtman's work on Cerny's conjecture? (states: "Max length of synchronizing word for a DFA is (n-1)² ")</p><p>In particular <a href="https://arxiv.org/abs/2105.09105" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">arxiv.org/abs/2105.09105</span><span class="invisible"></span></a> -- I find the method interesting but the logic gets somewhat chunky towards the end of the paper.</p><p>Thanks!</p><p><a href="https://mastodon.online/tags/math" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>math</span></a> <a href="https://mastodon.online/tags/computing" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>computing</span></a> <a href="https://mastodon.online/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a> <a href="https://mastodon.online/tags/proof" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>proof</span></a> <a href="https://mastodon.online/tags/statemachine" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>statemachine</span></a></p>
Ele Willoughby, PhD<p>Happy birthday to trailblazing American computer scientist Frances Elizabeth Allen (1932 – 2020) who made foundational contributions to optimizing compilers, optimizing programs and parallel computing. She was the first woman to become an IBM Fellow, where she worked from 1957 to 2002 and as an emeritus fellow afterwards. She was the first woman to win the Turing Prize. </p><p>IBM Research was recruiting teachers 🧵1/n</p><p><a href="https://spore.social/tags/printmaking" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>printmaking</span></a> <a href="https://spore.social/tags/womenInSTEM" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>womenInSTEM</span></a> <a href="https://spore.social/tags/histSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>histSci</span></a> <a href="https://spore.social/tags/mathematician" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mathematician</span></a> <a href="https://spore.social/tags/sciart" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>sciart</span></a> <a href="https://spore.social/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a> <a href="https://spore.social/tags/mastoArt" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mastoArt</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>: Post-doc position at ETH Zurich in formal semantics and verification (with a focus on Rust). <a href="https://tinyurl.com/2be5jpzb" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/2be5jpzb</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>
Papers We Love<p>📜 ZooKeeper: Wait-free Coordination for Internet-scale Systems [2010]</p><p>By: Patrick Hunt, M. Konar, F. Junqueira, et al.</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/zookeeper-wait-free-coordination-for-internet-scale-systems.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/zookeeper-wait-free-coordination-for-internet-scale-systems.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/e0398bac8adf7a3847a92b1a16b41bfb76cb7265" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/e039</span><span class="invisible">8bac8adf7a3847a92b1a16b41bfb76cb7265</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>
Nick Byrd, Ph.D.<p>What have papers about <a href="https://nerdculture.de/tags/cognitiveBias" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>cognitiveBias</span></a> been focusing on since 2010?</p><p>Plenty of work on <a href="https://nerdculture.de/tags/behaviorChange" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>behaviorChange</span></a> or <a href="https://nerdculture.de/tags/visualization" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>visualization</span></a>.</p><p>But human-computer interaction (<a href="https://nerdculture.de/tags/HCI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HCI</span></a>) appeared in 2019 ...and became the plurality?</p><p><a href="https://doi.org/10.1145/3706598.3713450" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">doi.org/10.1145/3706598.3713450</span><span class="invisible"></span></a></p><p><a href="https://nerdculture.de/tags/CogSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CogSci</span></a> <a href="https://nerdculture.de/tags/psychology" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>psychology</span></a> <a href="https://nerdculture.de/tags/CompSci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CompSci</span></a> <a href="https://nerdculture.de/tags/AI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AI</span></a> <a href="https://nerdculture.de/tags/edu" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>edu</span></a> <a href="https://nerdculture.de/tags/dataViz" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>dataViz</span></a></p>
Lobsters<p>2000 words about arrays and tables <a href="https://lobste.rs/s/bhs03m" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/bhs03m</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/rant" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>rant</span></a><br><a href="https://buttondown.com/hillelwayne/archive/2000-words-about-arrays-and-tables/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">buttondown.com/hillelwayne/arc</span><span class="invisible">hive/2000-words-about-arrays-and-tables/</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>: Research associate in formalization of mathematics at ICL. <a href="https://tinyurl.com/22cmbns5" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">tinyurl.com/22cmbns5</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> <a href="https://mathstodon.xyz/tags/Math" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Math</span></a></p>
@haitchfive

The Big OOPs:

Anatomy of a Thirty-five-year Mistake – BSC 2025

by Casey Muratori

youtube.com/watch?v=wo84LFzx5nI

I don't watch or attend a lot of conferences and talks these days, probably for the same reasons you shouldn't watch as much tv and believe it all as you used to.

But to me, at least, this is a deep and serious one worth your time in a fundamental way. If you are a programmer who actually cares about code, anyway.

YouTubeCasey Muratori – The Big OOPs: Anatomy of a Thirty-five-year Mistake – BSC 2025Von Better Software Conference
#programming#oops#compsci
AngesagtLive-Feeds
Über