Marcel Fröhlich @FroehlichMarcel@qoto.org

The Software Description Ontology

http://w3id.org/okn/o/sd/1.9.0

I understand that global search and indexing is intentionally kept in check for multiple reasons. Are there any (less comfortable) ways, like external search or whatever to discover stuff outside the local server or the people directly connected? #mastodon

How can I discover people in the fediverse interested in niche science content on certain topics, e.g. in the area of #computation #informationtheory #complexity? #mastodon

@AmpBenzScientist @freemo I plan to publish many more such science threads that I already accumulated on Twitter, but first I want to get it right to avoid posting into the void.

@freemo @AmpBenzScientist For example yesterday I published a thread on biology and cryptography. Not exactly a popular topic. In the vast fediverse there should a few people interested in this. How do I properly make my content/profile discoverable. And how can I actively search those? #Mastodon

Is there a way to whitelist languages and/or hashtags to get a more customised selection of others’ content? #mastodon

@AmpBenzScientist Hashtags seem to be key both on profile and in posts for discoverability.
@freemo when I / others use lots of hashtags, what are features that make use of it beyond local search?

@AmpBenzScientist Thanks @AmpBenzScientist my question is not so much about me. I’d like to convince more people to switch from Twitter to M. But without additional search capabilities is will be hard to reproduce the experience they find useful.

@yaksha Right, same here.

So this is the chicken egg problem for Mastodon for long tail topics. Obvious stuff like open source works well, but specialized science topics are hard. But I understand that it is an intentional design decision that saves people from the mob and from trolls.

Mastodon does not offer federated full text search on what people posted, right? Compared to Twitter that makes it much harder to find people on niche topics.

@AmpBenzScientist Sorry, have to research myself, I don’t know.

@AmpBenzScientist No problem, anything goes, whatever suits you best.

#complexity #computation #information
Anybody interested in that stuff here?

A good background text on algorithmic information theory can be found here:

http://www.scholarpedia.org/article/Algorithmic_information_theory

The key idea is that complexity can be best captured by the length of the most concise description of the regularities of a thing.

To understand, what Krakauer means with “regularised randomness” and “frozen accidents”, read

WHAT IS COMPLEXITY?

by Murray Gell-Mann, 1995

http://complexity.martinsewell.com/Gell95.pdf

@przemek How can I contact Chris McGee? Want to comment on his semantics proposal.

@dwarfghost@fosstodon.org GitHub offers free Jekyll hosting with GitHub pages.

Recently a proof was constructed, showing that perfect obfuscation is possible.
I.e. if some organisms eventually manage(d) to pull off this trick, others wouldn‘t even notice.

https://www.quantamagazine.org/computer-scientists-achieve-crown-jewel-of-cryptography-20201110/