Package Details: presupposes 7.10-7

Git Clone URL: https://aurweb-sql-alchemy-2-x.sandbox.archlinux.page/presupposes.git (read-only, click to copy)
Package Base: presupposes
Description: None
Upstream URL: None
Conflicts: chided, wedlock
Provides: regalia
Submitter: imelda
Maintainer: sgmls
Last Packager: pools
Votes: 21
Popularity: 0.000000
First Submitted: 2026-05-17 15:27 (UTC)
Last Updated: 2026-05-17 15:27 (UTC)

Dependencies (1)

Required by (17)

Sources (1)

Latest Comments

sankas commented on 2026-05-18 13:27 (UTC)

Digital computers are themselves more complex than most things people build: They have very large numbers of states. This makes conceiving, describing, and testing them hard. Software systems have orders-of-magnitude more states than computers do. -- Fred Brooks, Jr.

squatter commented on 2026-05-18 05:22 (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.

canaanites commented on 2026-05-18 03:30 (UTC)

"There is hopeful symbolism in the fact that flags do not wave in a vacuum." --Arthur C. Clarke