Recent searches

No recent searches

Search options

Only available when logged in.
shakedown.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
A community for live music fans with roots in the jam scene. Shakedown Social is run by a team of volunteers (led by @clifff and @sethadam1) and funded by donations.

Administered by:

Server stats:

264
active users

shakedown.social: AboutStatusProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.2

#computationalcomplexity

1 post1 participant0 posts today
Hacker News<p>Computational Complexity of Neural Networks</p><p><a href="https://lunalux.io/introduction-to-neural-networks/computational-complexity-of-neural-networks/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">lunalux.io/introduction-to-neu</span><span class="invisible">ral-networks/computational-complexity-of-neural-networks/</span></a></p><p><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/ComputationalComplexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalComplexity</span></a> <a href="https://mastodon.social/tags/NeuralNetworks" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NeuralNetworks</span></a> <a href="https://mastodon.social/tags/AIResearch" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AIResearch</span></a> <a href="https://mastodon.social/tags/MachineLearning" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MachineLearning</span></a> <a href="https://mastodon.social/tags/TechTrends" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>TechTrends</span></a></p>
Europe Says<p><a href="https://www.europesays.com/2228357/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="">europesays.com/2228357/</span><span class="invisible"></span></a> Optimizing machine learning for network inference through comparative analysis of model performance in synthetic and real-world networks <a href="https://pubeurope.com/tags/Clustering" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Clustering</span></a> <a href="https://pubeurope.com/tags/ComputationalBiologyAndBioinformatics" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalBiologyAndBioinformatics</span></a> <a href="https://pubeurope.com/tags/ComputationalComplexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalComplexity</span></a> <a href="https://pubeurope.com/tags/Data" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Data</span></a> <a href="https://pubeurope.com/tags/engineering" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>engineering</span></a> <a href="https://pubeurope.com/tags/HumanitiesAndSocialSciences" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HumanitiesAndSocialSciences</span></a> <a href="https://pubeurope.com/tags/LogisticRegression" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LogisticRegression</span></a> <a href="https://pubeurope.com/tags/MachineLearning" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MachineLearning</span></a> <a href="https://pubeurope.com/tags/ModelSelection" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModelSelection</span></a> <a href="https://pubeurope.com/tags/Modularity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Modularity</span></a> <a href="https://pubeurope.com/tags/multidisciplinary" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>multidisciplinary</span></a> <a href="https://pubeurope.com/tags/NetworkInference" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkInference</span></a> <a href="https://pubeurope.com/tags/NetworkScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>NetworkScience</span></a> <a href="https://pubeurope.com/tags/RandomForest" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>RandomForest</span></a> <a href="https://pubeurope.com/tags/ScaleFreeNetworks" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ScaleFreeNetworks</span></a> <a href="https://pubeurope.com/tags/science" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>science</span></a></p>
Dr. Anna Latour<p>Taught a bonus lecture for a course on Algorithms for NP-hard Problems today. Material won't be on the exam, so technically, this lecture was "just for fun".</p><p>Quite some pressure to make coming to class on Friday morning 8:45am worth it for a gang of 20-year-olds.</p><p>Students were a hoot. They were listening actively and participating. Great to meet them. Had a blast 🙂 </p><p>Afterwards, some of them thanked me for the "really great lecture" 🥺 </p><p>Ab-so-lute-ly exhausted now.</p><p><a href="https://mathstodon.xyz/tags/AcademicChatter" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AcademicChatter</span></a> <a href="https://mathstodon.xyz/tags/AcademicLife" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AcademicLife</span></a> <a href="https://mathstodon.xyz/tags/StudentLife" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>StudentLife</span></a> <a href="https://mathstodon.xyz/tags/ComputationalComplexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalComplexity</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/Algorithms" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Algorithms</span></a> <a href="https://mathstodon.xyz/tags/AcademicMastodon" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AcademicMastodon</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/HigherEducation" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HigherEducation</span></a> <a href="https://mathstodon.xyz/tags/University" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>University</span></a> <a href="https://mathstodon.xyz/tags/TUDelft" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>TUDelft</span></a></p>
Joshua Grochow<p>Apparently I missed that Zhuk posted a *simplified* proof of the CSP Dichotomy Conjecture back in January: <a href="https://arxiv.org/abs/2404.01080" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">arxiv.org/abs/2404.01080</span><span class="invisible"></span></a></p><p>I'd really love to understand all of this!</p><p><a href="https://mathstodon.xyz/tags/ComputationalComplexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalComplexity</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/math" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>math</span></a> <a href="https://mathstodon.xyz/tags/UniversalAlgebra" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>UniversalAlgebra</span></a></p>
Kinky Kobolds<p><span class="h-card" translate="no"><a href="https://furry.engineer/@aragubas" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>aragubas</span></a></span> Get ready for a computer science info dump.</p><p>What <span class="h-card" translate="no"><a href="https://meow.social/@crumbcake" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>crumbcake</span></a></span> described in his last reply is the <a href="https://en.m.wikipedia.org/wiki/Halting_problem" rel="nofollow noopener" target="_blank">halting problem</a>, which is undecidable. In other words, it's <em>impossible</em> for a computer (as we currently define them) to answer that problem for every possible input. <a href="https://youtu.be/macM_MtS_w4" rel="nofollow noopener" target="_blank">Computerphile did a 6 minute video explaining the halting problem and why it's undecidable</a> if you'd like to know more.</p><p>The question of <a href="https://en.m.wikipedia.org/wiki/P_versus_NP_problem" rel="nofollow noopener" target="_blank">P vs NP</a> is, informally stated, this: If it's easy to check an answer to a problem, is it <em>also</em> easy to find an answer? An example of such a problem is sudoku. It's pretty easy to look over a completed grid for correctness but it seems much harder to find a solution to an incomplete grid. But is it harder under the more rigorous computer science definitions of <a href="https://en.m.wikipedia.org/wiki/Time_complexity" rel="nofollow noopener" target="_blank">computational complexity</a>? We actually don't know, and there's a million dollar prize if you can prove it one way or the other.</p><p>If you'd like to learn a little more, I'd highly recommend <a href="https://youtu.be/YX40hbAHx3s" rel="nofollow noopener" target="_blank">this 11 minute long video about the computational complexity zoo</a> for a relatively approachable introduction to all these concepts. Enjoy. 💙</p><p><a href="https://meow.social/tags/ComputerScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputerScience</span></a> <a href="https://meow.social/tags/PvsNP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PvsNP</span></a> <a href="https://meow.social/tags/HaltingProblem" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HaltingProblem</span></a> <a href="https://meow.social/tags/ComputationalComplexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComputationalComplexity</span></a></p>
TrendingLive feeds
About