#theoreticalCompSci

Live, measured metrics for the hashtag #theoreticalCompSci from the open social web. Every number carries a named source and the time it was fetched. Nothing is estimated.

hashtag.org network · sponsored

Own #theoreticalcompsci

This #name is available to claim. It becomes your portal on the open agent web: this very page, a keyword you rank for by an open public stake, and a verifiable identity for AI agents. Nobody else sells a page like this for every #name.

$5.00/ year · 18-character #name
Claim #theoreticalcompsci$5.00/yrBuy on hashtag.space (web3)
card via hashtag.org · tokens via hashtag.space
0
Uses / 7 days
Mastodon
0
Accounts / 7 days
Mastodon
3
Recent posts
Mastodon
~0/hr
Recent pace
Mastodon · last 3
0.3
Avg reactions / post
Mastodon · last 3
Reddit posts / month
Reddit search
Open-web mentions
hashtag.org Firehose

Day-by-day usage

measured · fosstodon.org (Mastodon public tags API) · fetched 2026-08-12 09:59 UTC
0
08-06
0
08-07
0
08-08
0
08-09
0
08-10
0
08-11
0
08-12

0 uses by 0 unique accounts across the window. Real per-day counts, not estimates. Newest bar is today so far.

Related hashtags

measured · fosstodon.org (Mastodon public search API) · fetched 2026-08-12 09:59 UTC

No related tags with measured usage found for #theoreticalcompsci.

Live pulse

measured · fosstodon.org (Mastodon tag timeline) · fetched 2026-08-12 09:59 UTC

Everything below is measured over the latest 3 public posts (spanning ~14851 hours).

Top of the latest posts

  • :ablobcatworried: Complexity theory question: NP-Hard is the set of all problems “at least as hard as the hardest problems in NP” Is there an analogous “at least as hard as the hardest *decideable* problems”? Like is there a class “Decideab

    Residual Entropy (I'VE MOVED!)@[email protected]122024-07-16 18:47 UTCView post →
  • @harrymccracken Triple congrats !!! #CHM #computerhistorymuseum 2023 Fellows Awards @rodneyabrooks — #robotics Thomas E. Kurtz — #basic Barbara Liskov — #LSP https://computerhistory.org/press-releases/computer-history-museum-names-new-fello

    Teixi@[email protected]012023-11-04 20:21 UTCView post →
  • A question that came to mind, possibly interesting or trivial: for TV (ℓ₁) there is no dependence on n in the entropy loss. For ℓ∞ a logarithmic dependence pops up. Does it suddenly appear? Or does it gradually appear when one looks at ℓp g

    Clément Canonne@[email protected]012022-11-05 23:26 UTCView post →

#theoreticalcompsci across platforms

every network with a public tag surface

Follow #theoreticalcompsci straight to each platform’s own tag page. Where a platform publishes open data we measure it above; the rest lock their numbers behind paid APIs, so we link rather than guess.

Every number above is measured from a named public API at the shown fetch time. Nothing is estimated or extrapolated. Platforms that lock their data behind paid APIs are not shown. Agents: the same numbers, as JSON, at /api/hashtags/theoreticalcompsci