troet.cafe ist Teil eines dezentralisierten sozialen Netzwerks, angetrieben von Mastodon.
Hallo im troet.cafe! Dies ist die derzeit größte deutschsprachige Mastodon Instanz zum tröten, neue Leute kennenlernen, sich auszutauschen und Spaß zu haben.

Verwaltet von:

Serverstatistik:

7,2 Tsd.
aktive Profile

Mehr erfahren

#computability

0 Beiträge0 Beteiligte0 Beiträge heute
Tom de Jong<p>I'm pleased to announce that the Heyting Day will be held in Amsterdam on Friday 14 March 2025.</p><p>Its theme will be models of <a href="https://mathstodon.xyz/tags/intuitionism" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>intuitionism</span></a> and <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computability</span></a> and mark the retirement of Jaap van Oosten.</p><p>The invited speakers are:<br>- <span class="h-card" translate="no"><a href="https://mathstodon.xyz/@andrejbauer" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>andrejbauer</span></a></span> (Ljubljana)<br>- Andy Pitts (Cambridge)<br>- Sebastiaan Terwijn (Nijmegen)<br>- Jaap van Oosten (Utrecht)</p><p>Attendance is free. Sign up and more details here: <a href="https://www.knaw.nl/en/heyting-day-2025" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="">knaw.nl/en/heyting-day-2025</span><span class="invisible"></span></a></p><p>The attached poster is thanks to the amazing <span class="h-card" translate="no"><a href="https://mathstodon.xyz/@jacobneu" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>jacobneu</span></a></span>.</p>
Kino Zhao<p>A very niche question on <a href="https://fediphilosophy.org/tags/computability" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computability</span></a> theory that I couldn't find the answer to. On the off chance that someone has a lead:</p><p>In Turing's 1936 paper he gave a construction of Turing machines, a proof that they are enumerable, and two proofs of the halting problem. When we talk about TMs now we typically talk about TMs that halt (ends with a halting symbol) or does not halt. Turing didn't have a halting symbol. Instead he distinguishes circular (machines that print only finitely many symbols) and circle-free (otherwise) machines. They are basically the same and play the same roles in the halting problem proof.</p><p>Here's the thing: Turing's circular machines correspond to non-halting machines and circle-free machines (ones that go on to print infinitely many symbols) correspond to halting machines. I have a very hard time seeing how this works. Any idea? pointers to secondary sources?</p><p>It all happened in the span of 3 pages which I've read 10 times already :(</p>
Counting Is Hard<p>I wrote up the post on Weihrauch reducibility &amp; Lenses. Would appreciate any comments / boosts etc.</p><p><a href="https://www.countingishard.org/blog/weihrauch-reducibility-as-a-lens" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">countingishard.org/blog/weihra</span><span class="invisible">uch-reducibility-as-a-lens</span></a></p><p><a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computability</span></a> <a href="https://mathstodon.xyz/tags/complexity" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>complexity</span></a> <a href="https://mathstodon.xyz/tags/categorytheory" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>categorytheory</span></a></p>
Abde :verified:<p>Hello! </p><p>After a few days figuring out Mastodon with the help of the folks at QOTO, I will formally introduce myself in order to pin this in my profile :)</p><p>My name is Abde and I am a computer scientist. My main domain is <a href="https://qoto.org/tags/NumericalCalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>NumericalCalculus</span></a> and <a href="https://qoto.org/tags/ParallelComputing" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ParallelComputing</span></a>. I am currently a PhD student at the Université Libre de Bruxelles (<a href="https://qoto.org/tags/belgium" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>belgium</span></a>) and working on porting numerical solvers for simulations on the GPU using <a href="https://qoto.org/tags/CUDA" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>CUDA</span></a>. You may find my first paper here: <a href="https://etna.math.kent.edu/vol.55.2022/pp687-705.dir/pp687-705.pdf" rel="nofollow noopener noreferrer" target="_blank"><span class="invisible">https://</span><span class="ellipsis">etna.math.kent.edu/vol.55.2022</span><span class="invisible">/pp687-705.dir/pp687-705.pdf</span></a></p><p>Other research interests are <a href="https://qoto.org/tags/complexity" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>complexity</span></a> <a href="https://qoto.org/tags/computability" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computability</span></a> <a href="https://qoto.org/tags/graphtheory" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphtheory</span></a> <a href="https://qoto.org/tags/geometry" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>geometry</span></a> <a href="https://qoto.org/tags/discretemath" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>discretemath</span></a></p><p>I also work as a <a href="https://qoto.org/tags/VirtualReality" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>VirtualReality</span></a> developer. My current professional interests are <a href="https://qoto.org/tags/simulations" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>simulations</span></a> <a href="https://qoto.org/tags/numericalcalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>numericalcalculus</span></a> <a href="https://qoto.org/tags/geometry" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>geometry</span></a>. We also contribute in several <a href="https://qoto.org/tags/opensource" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>opensource</span></a> projects. Most of my work is done in <a href="https://qoto.org/tags/Unity3D" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Unity3D</span></a>, so feel free to ask any questions!</p><p>As a hobby I do some <a href="https://qoto.org/tags/gamedev" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>gamedev</span></a> and also <a href="https://qoto.org/tags/musicproduction" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>musicproduction</span></a>. I will share some snippets of what I do here, but for now I am focusing in crafting my art by producing <a href="https://qoto.org/tags/housemusic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>housemusic</span></a> in <a href="https://qoto.org/tags/bitwig" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>bitwig</span></a>.</p><p>Please enjoy! I am not the most active but I am looking to build my Mastodon network, so feel free to follow and I will follow back :)</p><p><a href="https://qoto.org/tags/introduction" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>introduction</span></a> <a href="https://qoto.org/tags/mastodon" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>mastodon</span></a> <a href="https://qoto.org/tags/newcomer" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>newcomer</span></a> <a href="https://qoto.org/tags/developer" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>developer</span></a> <a href="https://qoto.org/tags/music" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>music</span></a> <a href="https://qoto.org/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a></p>
Richard Zach<p>I'm a logician and historian and philosopher of <a href="https://mathstodon.xyz/tags/logic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logic</span></a>, <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computability</span></a>, and analytic philosophy. I run <a href="https://openlogicproject.org/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">openlogicproject.org/</span><span class="invisible"></span></a> <a href="https://mathstodon.xyz/tags/Introduction" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Introduction</span></a> <a href="https://mathstodon.xyz/tags/philosophy" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>philosophy</span></a></p>