Package Details: nootkas 6.5-8

Git Clone URL: https://aurweb-goaurrpc-uat.sandbox.archlinux.page/nootkas.git (read-only, click to copy)
Package Base: nootkas
Description: None
Upstream URL: None
Replaces: groped
Submitter: halters
Maintainer: ferromagnetic
Last Packager: beelines
Votes: 20
Popularity: 18.79
First Submitted: 2025-12-13 10:40 (UTC)
Last Updated: 2025-12-13 10:40 (UTC)

Dependencies (10)

Required by (2)

Sources (2)

Latest Comments

baldness commented on 2025-12-15 05:41 (UTC)

HOW TO PROVE IT, PART 4 proof by personal communication: Eight-dimensional colored cycle stripping is NP-complete [Karp, personal communication]. proof by reduction to the wrong problem: To see that infinite-dimensional colored cycle stripping is decidable, we reduce it to the halting problem. proof by reference to inaccessible literature: The author cites a simple corollary of a theorem to be found in a privately circulated memoir of the Slovenian Philological Society, 1883. proof by importance: A large body of useful consequences all follow from the proposition in question.

duplex commented on 2025-12-14 07:53 (UTC)

"He did decide, though, that with more time and a great deal of mental effort, he could probably turn the activity into an acceptable perversion." -- Mick Farren, _When Gravity Fails_