Generic algorithms for halting problem and optimal machines revisited

Overview of attention for article published in Logical Methods in Computer Science (LMCS), April 2016

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
Among the highest-scoring outputs from this source (#22 of 1,204)
High Attention Score compared to outputs of the same age (88th percentile)
High Attention Score compared to outputs of the same age and source (87th percentile)

Mentioned by

twitter: 7 X users
wikipedia: 1 Wikipedia page

reddit: 1 Redditor
q&a: 3 Q&A threads

Readers on

mendeley: 6 Mendeley

So far, Altmetric has seen 7 X posts from 7 X users, with an upper bound of 45,465 followers.

@ModelOfTheory @ElliotGlazer The opposite is true (in some sense) : for models with a Kolmogorov complexity function minimal up to an additive constant, the asymptotic fraction of halting programs doesn't exist, see theorem 4.1b in https://t.co/owHPAFQ83K

RT @todesking: 面白そうな論文2です: [1505.00731] Generic algorithms for halting problem and optimal machines revisited https://t.co/Ji5HZVTGsC

@Tomi_Tapio @ben_levinstein @kevin_dorst Check out the abstract! https://t.co/gR9jBySt7Q

@ben_levinstein 2015 pdf, generic halting problem algorithms https://t.co/4cqhOw1UE0 cc @kevin_dorst

This page shows the most recent X posts that mention this research output. Click here to find out how to access more activity, including 3 additional X posts.