MastodonTech.de

Counting Is HardThanks to the work of <a href="https://mastodon.acm.org/@mspstrath" class="u-url mention" rel="nofollow noopener" target="_blank">@mspstrath</a> all the TYPES 2025 talks are available (including mine) Update: as fred points out the playlist was not supposed to be public yet, so, er watch this space<a href="https://www.youtube.com/watch?v=W-lYwG3E_x4&" rel="nofollow noopener" translate="no" target="_blank">https://www.youtube.com/watch?v=W-lYwG3E_x4&</a>Like comment and subscribe, ring the bell, all that stuff<a href="https://mathstodon.xyz/tags/categorytheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#categorytheory</a> <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a>

Counting Is HardAs promised. Here is the sequel to my Weihrauch reductions are Containers post, this time relating strong reductions to dependent adaptors. Enjoy!<a href="https://www.countingishard.org/blog/strong-reducibility-as-an-adaptor" rel="nofollow noopener" translate="no" target="_blank">https://www.countingishard.org/blog/strong-reducibility-as-an-adaptor</a><a href="https://mathstodon.xyz/tags/categorytheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#categorytheory</a> <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a>

janIn short, intuition, insight, and creativity are not computable. —Aloisius H. Louie, More Than Life Itself <a class="hashtag" href="https://pleroma.microblog.se/tag/computability" rel="nofollow noopener" target="_blank">#computability</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computation" rel="nofollow noopener" target="_blank">#computation</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/abduction" rel="nofollow noopener" target="_blank">#abduction</a>

jan…what if life itself is, even in principle, nonsimulable? There are, of course, many things that mechanization by rote does better than life, in terms of speed, repeatability, precision, and so forth. On the other hand, a living system…may be characterized by its ability to handle ambiguities and take chances, indeed, its ability to err. These are precisely the processes that cannot, by definition…, be modelled algorithmically. —Aloisius H. Louie, More Than Life Itself: A Synthetic Continuation in Relational Biology <a class="hashtag" href="https://pleroma.microblog.se/tag/life" rel="nofollow noopener" target="_blank">#life</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computability" rel="nofollow noopener" target="_blank">#computability</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computation" rel="nofollow noopener" target="_blank">#computation</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/algorithms" rel="nofollow noopener" target="_blank">#algorithms</a>

jan“A computer is a very specific kind of mathematical structure, it means computational mathematics. If you study the mathematics as an abstract subject you rapidly learn that there are things way way beyond computability. … You can't get at it by an algorithm.” —Roger Penrose <a href="https://youtu.be/biUfMZ2dts8?t=942" rel="nofollow noopener" target="_blank">https://youtu.be/biUfMZ2dts8?t=942</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/mathematics" rel="nofollow noopener" target="_blank">#mathematics</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computation" rel="nofollow noopener" target="_blank">#computation</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computability" rel="nofollow noopener" target="_blank">#computability</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/algorithms" rel="nofollow noopener" target="_blank">#algorithms</a>

TevinAlan Turing had proven that determining whether an arbitrary program will halt (terminate) or run forever is non-computable.Sir Roger Penrose claims that human consciousness might involve non-computable processes, thus won't be achievable with current computer-driven AI implementations. However, this doesn't mean that these AIs won't be better than humans in certain tasks.<a href="https://www.youtube.com/watch?v=biUfMZ2dts8" rel="nofollow noopener" translate="no" target="_blank">https://www.youtube.com/watch?v=biUfMZ2dts8</a><a href="https://mastodon.tevinzhang.com/tags/penrose" class="mention hashtag" rel="nofollow noopener" target="_blank">#penrose</a> <a href="https://mastodon.tevinzhang.com/tags/turing" class="mention hashtag" rel="nofollow noopener" target="_blank">#turing</a> <a href="https://mastodon.tevinzhang.com/tags/ai" class="mention hashtag" rel="nofollow noopener" target="_blank">#ai</a> <a href="https://mastodon.tevinzhang.com/tags/consciousness" class="mention hashtag" rel="nofollow noopener" target="_blank">#consciousness</a> <a href="https://mastodon.tevinzhang.com/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a>

amen zwa, esq.A <a href="https://mathstodon.xyz/tags/ComputerScience" class="mention hashtag" rel="nofollow noopener" target="_blank">#ComputerScience</a> student who first encounters the <a href="https://mathstodon.xyz/tags/Computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#Computability</a> Theory (𝜆-Calculus, Turing Machine, General Recursive Functions, or the equivalents) ought to be, at once, awed and appalled.He ought to be awed that something so simple as the 𝜆-Calculus can express complete complex computations and something so simple as the Turing Machine is conceptually as capable as modern complex computers.At the same time, the student ought to be appalled at today's trend of worshiping expedient complexity and denouncing the difficult, but rewarding, pursuit of the basal simplicity that underlies all things computing.

Tom de JongI'm pleased to announce that the Heyting Day will be held in Amsterdam on Friday 14 March 2025.Its theme will be models of <a href="https://mathstodon.xyz/tags/intuitionism" class="mention hashtag" rel="nofollow noopener" target="_blank">#intuitionism</a> and <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a> and mark the retirement of Jaap van Oosten.The invited speakers are: - <a href="https://mathstodon.xyz/@andrejbauer" class="u-url mention" rel="nofollow noopener" target="_blank">@andrejbauer</a> (Ljubljana) - Andy Pitts (Cambridge) - Sebastiaan Terwijn (Nijmegen) - Jaap van Oosten (Utrecht)Attendance is free. Sign up and more details here: <a href="https://www.knaw.nl/en/heyting-day-2025" rel="nofollow noopener" translate="no" target="_blank">https://www.knaw.nl/en/heyting-day-2025</a>The attached poster is thanks to the amazing <a href="https://mathstodon.xyz/@jacobneu" class="u-url mention" rel="nofollow noopener" target="_blank">@jacobneu</a>.

jan“…AI simply is not intelligent. And there is no way you should be calling it artificial intelligence. It's artificial information processing. That's what the I stands for. And it's done well by a machine that can be vamped up to process an enormous amount of information. but…it doesn't have experience, it doesn't have any of the elements that go to being a human being. And AI people want to know from me in some ways how they can replicate right hemisphere thinking in a computer. … But you cannot turn right hemisphere thinking into something that is computable. It is strictly non-computable because it involves the acceptance of so many uncertainties that there is no place from which it can anchor itself. It can't be done by a series of steps. And what of course is true of right hemisphere thinking is true more generally of organisms and systems in the cosmos, because right hemisphere thinking is better able to reflect the structure of those.” —Iain McGilchrist, Metaphysics and the Matter With Things, Session 3.1 - Saturday Closing Dialogue <a class="hashtag" href="https://pleroma.microblog.se/tag/iainmcgilchrist" rel="nofollow noopener" target="_blank">#iainmcgilchrist</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/ai" rel="nofollow noopener" target="_blank">#ai</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/artificialintelligence" rel="nofollow noopener" target="_blank">#artificialintelligence</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computability" rel="nofollow noopener" target="_blank">#computability</a>

Counting Is HardI wrote up the post on Weihrauch reducibility & Lenses. Would appreciate any comments / boosts etc.<a href="https://www.countingishard.org/blog/weihrauch-reducibility-as-a-lens" rel="nofollow noopener" translate="no" target="_blank">https://www.countingishard.org/blog/weihrauch-reducibility-as-a-lens</a><a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a> <a href="https://mathstodon.xyz/tags/complexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#complexity</a> <a href="https://mathstodon.xyz/tags/categorytheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#categorytheory</a>

jan"There is a distinct difference between the modus operandi of the left hemisphere and the right. Left hemisphere procedures are highly computable. AI is really a way of pushing out the left hemisphere's mode of thinking into the environment. But what the right hemisphere does is strictly non-computable because it has no points of certainty in it. A computer needs at least one or two reference points with which to begin working, but in essence there is nothing but experience, either the experience of the cell, or the plant, or the root, or the whatever it is, and so it can't be engineered according to principles." <a href="https://youtu.be/YGCYDw9-yDQ?t=1556" rel="nofollow noopener" target="_blank">https://youtu.be/YGCYDw9-yDQ?t=1556</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/iainmcgilchrist" rel="nofollow noopener" target="_blank">#iainmcgilchrist</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/mcgilchrist" rel="nofollow noopener" target="_blank">#mcgilchrist</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/artificialintelligence" rel="nofollow noopener" target="_blank">#artificialintelligence</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/ai" rel="nofollow noopener" target="_blank">#ai</a> <a class="hashtag" href="https://pleroma.microblog.se/tag/computability" rel="nofollow noopener" target="_blank">#computability</a>

Shakthi KannanComputability in Europe 2024 Amsterdam, 8-12 July 2024 <a href="https://events.illc.uva.nl/CiE/CiE2024/Main/" rel="nofollow noopener" translate="no" target="_blank">https://events.illc.uva.nl/CiE/CiE2024/Main/</a> <a href="https://mastodon.social/tags/theory" class="mention hashtag" rel="nofollow noopener" target="_blank">#theory</a> <a href="https://mastodon.social/tags/computerscience" class="mention hashtag" rel="nofollow noopener" target="_blank">#computerscience</a> <a href="https://mastodon.social/tags/logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#logic</a> <a href="https://mastodon.social/tags/quantum" class="mention hashtag" rel="nofollow noopener" target="_blank">#quantum</a> <a href="https://mastodon.social/tags/cryptography" class="mention hashtag" rel="nofollow noopener" target="_blank">#cryptography</a> <a href="https://mastodon.social/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a>

Mi LiaYet another classic, at last found its way to my library. I'm wondering. If <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a> and <a href="https://mathstodon.xyz/tags/unsolvability" class="mention hashtag" rel="nofollow noopener" target="_blank">#unsolvability</a> theories are mostly concerned with the existence of algorithms for classes of problems, if one could prove or disprove such a thing (class of theorems?) starting from <a href="https://mathstodon.xyz/tags/geometry" class="mention hashtag" rel="nofollow noopener" target="_blank">#geometry</a>.I'll explain. I've recently understood (Steenrod et al, "First concepts of topology") that <a href="https://mathstodon.xyz/tags/topology" class="mention hashtag" rel="nofollow noopener" target="_blank">#topology</a> is mostly concerned in proving existence theorems. The subject matter of this book sounds, in a way, like an attempt to prove such theorems. So naturally I came to wonder if anyone had attempted tackling them with topological means and tools instead. I haven't looked to see if this question even makes sense, but my humble instinct says that maybe yes, and that most likely at least someone has worked on it in the past.

Abde :verified:Hello! 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 :)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" target="_blank">#NumericalCalculus</a> and <a href="https://qoto.org/tags/ParallelComputing" class="mention hashtag" rel="nofollow noopener" target="_blank">#ParallelComputing</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" target="_blank">#belgium</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" target="_blank">#CUDA</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" target="_blank">https://etna.math.kent.edu/vol.55.2022/pp687-705.dir/pp687-705.pdf</a>Other research interests are <a href="https://qoto.org/tags/complexity" class="mention hashtag" rel="nofollow noopener" target="_blank">#complexity</a> <a href="https://qoto.org/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a> <a href="https://qoto.org/tags/graphtheory" class="mention hashtag" rel="nofollow noopener" target="_blank">#graphtheory</a> <a href="https://qoto.org/tags/geometry" class="mention hashtag" rel="nofollow noopener" target="_blank">#geometry</a> <a href="https://qoto.org/tags/discretemath" class="mention hashtag" rel="nofollow noopener" target="_blank">#discretemath</a>I also work as a <a href="https://qoto.org/tags/VirtualReality" class="mention hashtag" rel="nofollow noopener" target="_blank">#VirtualReality</a> developer. My current professional interests are <a href="https://qoto.org/tags/simulations" class="mention hashtag" rel="nofollow noopener" target="_blank">#simulations</a> <a href="https://qoto.org/tags/numericalcalculus" class="mention hashtag" rel="nofollow noopener" target="_blank">#numericalcalculus</a> <a href="https://qoto.org/tags/geometry" class="mention hashtag" rel="nofollow noopener" target="_blank">#geometry</a>. We also contribute in several <a href="https://qoto.org/tags/opensource" class="mention hashtag" rel="nofollow noopener" target="_blank">#opensource</a> projects. Most of my work is done in <a href="https://qoto.org/tags/Unity3D" class="mention hashtag" rel="nofollow noopener" target="_blank">#Unity3D</a>, so feel free to ask any questions!As a hobby I do some <a href="https://qoto.org/tags/gamedev" class="mention hashtag" rel="nofollow noopener" target="_blank">#gamedev</a> and also <a href="https://qoto.org/tags/musicproduction" class="mention hashtag" rel="nofollow noopener" target="_blank">#musicproduction</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" target="_blank">#housemusic</a> in <a href="https://qoto.org/tags/bitwig" class="mention hashtag" rel="nofollow noopener" target="_blank">#bitwig</a>.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 :)<a href="https://qoto.org/tags/introduction" class="mention hashtag" rel="nofollow noopener" target="_blank">#introduction</a> <a href="https://qoto.org/tags/mastodon" class="mention hashtag" rel="nofollow noopener" target="_blank">#mastodon</a> <a href="https://qoto.org/tags/newcomer" class="mention hashtag" rel="nofollow noopener" target="_blank">#newcomer</a> <a href="https://qoto.org/tags/developer" class="mention hashtag" rel="nofollow noopener" target="_blank">#developer</a> <a href="https://qoto.org/tags/music" class="mention hashtag" rel="nofollow noopener" target="_blank">#music</a> <a href="https://qoto.org/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a>

Richard ZachI'm a logician and historian and philosopher of <a href="https://mathstodon.xyz/tags/logic" class="mention hashtag" rel="nofollow noopener" target="_blank">#logic</a>, <a href="https://mathstodon.xyz/tags/computability" class="mention hashtag" rel="nofollow noopener" target="_blank">#computability</a>, and analytic philosophy. I run <a href="https://openlogicproject.org/" rel="nofollow noopener" target="_blank">https://openlogicproject.org/</a> <a href="https://mathstodon.xyz/tags/Introduction" class="mention hashtag" rel="nofollow noopener" target="_blank">#Introduction</a> <a href="https://mathstodon.xyz/tags/philosophy" class="mention hashtag" rel="nofollow noopener" target="_blank">#philosophy</a>

Frühere Suchanfragen

Suchoptionen

Verwaltet von:

Serverstatistik:

#computability