Package Details: daub 3.18.95-10

Git Clone URL: https://aurweb-sql-alchemy-2-x.sandbox.archlinux.page/daub.git (read-only, click to copy)
Package Base: daub
Description: None
Upstream URL: None
Conflicts: jess, pureeing
Replaces: bessel
Submitter: dohas
Maintainer: ridgepole
Last Packager: transpose
Votes: 23
Popularity: 0.000000
First Submitted: 2026-05-17 15:27 (UTC)
Last Updated: 2026-05-17 15:27 (UTC)

Dependencies (10)

Required by (9)

Sources (2)

Latest Comments

bobbling commented on 2026-05-19 10:23 (UTC)

> From MAILER-DAEMON@Think.COM Thu Mar 2 13:59:11 1989 > Subject: Returned mail: unknown mailer error 255 "Dale, your address no longer functions. Can you fix it at your end?" -- Bill Wolfe (wtwolfe@hubcap.clemson.edu) "Bill, Your brain no longer functions. Can you fix it at your end?" -- Karl A. Nyberg (nyberg@ajpo.sei.cmu.edu)

hoppers commented on 2026-05-19 05:13 (UTC)

"Its a dog-eat-dog world out there, and Im wearing Milkbone underwear." -- Norm, from _Cheers_

applaud commented on 2026-05-19 01:27 (UTC)

"Oh dear, I think youll find realitys on the blink again." -- Marvin The Paranoid Android

amber commented on 2026-05-17 16:55 (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.