fosstodon.org is one of the many independent Mastodon servers you can use to participate in the fediverse.
Fosstodon is an invite only Mastodon instance that is open to those who are interested in technology; particularly free & open source software. If you wish to join, contact us for an invite.

Administered by:

Server stats:

8.5K
active users

#decidability

0 posts0 participants0 posts today
alexanderadam<p>Every single talk that I saw from <span class="h-card" translate="no"><a href="https://tu.social/@rosa" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>rosa</span></a></span> is just fantastic and highly recommended. 🤩</p><p><a href="https://rosa.codes/machines2025/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">rosa.codes/machines2025/</span><span class="invisible"></span></a></p><p><a href="https://ruby.social/tags/brightonruby" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>brightonruby</span></a> <a href="https://ruby.social/tags/rubyconference" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>rubyconference</span></a> <a href="https://ruby.social/tags/RubyProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>RubyProgramming</span></a> <a href="https://ruby.social/tags/godelianriddle" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>godelianriddle</span></a> <a href="https://ruby.social/tags/goedelianriddle" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>goedelianriddle</span></a> <a href="https://ruby.social/tags/hilbertsprogram" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>hilbertsprogram</span></a> <a href="https://ruby.social/tags/decidability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>decidability</span></a> <a href="https://ruby.social/tags/entscheidungsproblem" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>entscheidungsproblem</span></a> <a href="https://ruby.social/tags/brightonruby2025" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>brightonruby2025</span></a> <a href="https://ruby.social/tags/turingmachine" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>turingmachine</span></a> <a href="https://ruby.social/tags/smullyan" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>smullyan</span></a> <a href="https://ruby.social/tags/raymondsmullyan" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>raymondsmullyan</span></a></p>
Jan de Muijnck-Hughes<p>Look 'Ma' still no Void, ergonomics aside, *I* think this is cool. I am hoping <a href="https://discuss.systems/tags/TYPES2025" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>TYPES2025</span></a> will do too!</p><p>```<br>λΠ&gt; Tree.ALL.all {p=GT 3} (\x =&gt; (GreaterThan.isGT 3 x)) (Node 6 Leaf (Node 7 Leaf Leaf))<br>Left (Here (LTESucc (LTESucc (LTESucc LTEZero))))<br>```</p><p>```<br>λΠ&gt; decEq [Z,(S Z),(S (S Z))] [1,2,3]<br>Left (HeadNot MoreRight)<br>λΠ&gt; decEq [Z,(S Z),(S (S Z))] [Z,(S Z),(S (S Z))] <br>Right (There Zero (There (Succ Zero) (There (Succ (Succ Zero)) Here)))<br>λΠ&gt; <br>```</p><p><a href="https://discuss.systems/tags/dependent_types" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>dependent_types</span></a> <a href="https://discuss.systems/tags/constructive_negation" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>constructive_negation</span></a> <a href="https://discuss.systems/tags/decidability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>decidability</span></a> <a href="https://discuss.systems/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a></p>
Jan de Muijnck-Hughes<p>Huzzah, I fixed my interface issues. </p><p>Although I can do the following stuff before I solved the infrastructure so setting this up is easier.</p><p>```<br>λΠ&gt; Positive.decEq Z (S Z)<br>Left MoreRight<br>λΠ&gt; Positive.decEqN Z (S Z)<br>Right MoreRight<br>λΠ&gt; Positive.decEq (S Z) (S Z)<br>Right (Succ Zero)<br>λΠ&gt; Positive.decEqN (S Z) (S Z)<br>Left (Succ Zero)<br>```</p><p><a href="https://discuss.systems/tags/dependent_types" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>dependent_types</span></a> <a href="https://discuss.systems/tags/decidability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>decidability</span></a> <a href="https://discuss.systems/tags/positive" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>positive</span></a> <a href="https://discuss.systems/tags/constructive" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>constructive</span></a></p>
रञ्जित (Ranjit Mathew)<p>On the <a href="https://mastodon.social/tags/TuringMachinw" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>TuringMachinw</span></a>:</p><p>“The Most Important Machine That Was Never Built”, Quanta (<a href="https://www.quantamagazine.org/alan-turings-most-important-machine-was-never-built-20230503/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">quantamagazine.org/alan-turing</span><span class="invisible">s-most-important-machine-was-never-built-20230503/</span></a>).</p><p><a href="https://mastodon.social/tags/Turing" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Turing</span></a> <a href="https://mastodon.social/tags/AlanTuring" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>AlanTuring</span></a> <a href="https://mastodon.social/tags/Decidability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Decidability</span></a></p>
Bornach<p><span class="h-card" translate="no"><a href="https://infosec.exchange/@patrickcmiller" class="u-url mention">@<span>patrickcmiller</span></a></span><br />[Up and Atom] videos on <a href="https://fosstodon.org/tags/computability" class="mention hashtag" rel="tag">#<span>computability</span></a><br /><a href="https://youtu.be/t37GQgUPa6k" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://</span><span class="">youtu.be/t37GQgUPa6k</span><span class="invisible"></span></a><br /><a href="https://youtu.be/PLVCscCY4xI" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://</span><span class="">youtu.be/PLVCscCY4xI</span><span class="invisible"></span></a></p><p><a href="https://fosstodon.org/tags/YouTube" class="mention hashtag" rel="tag">#<span>YouTube</span></a> <a href="https://fosstodon.org/tags/TuringMachines" class="mention hashtag" rel="tag">#<span>TuringMachines</span></a> <a href="https://fosstodon.org/tags/HaltingProblem" class="mention hashtag" rel="tag">#<span>HaltingProblem</span></a> <a href="https://fosstodon.org/tags/Decidability" class="mention hashtag" rel="tag">#<span>Decidability</span></a></p>
xameer<p>- one can speak unambiguously of the <a href="https://ioc.exchange/tags/decidability" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>decidability</span></a> of the word problem for the finitely generated group G.</p>