kogasa

joined 2 years ago
[–] kogasa@programming.dev 4 points 7 months ago (1 children)

Java is a fine choice. Much prefer it over pseudocode.

[–] kogasa@programming.dev 0 points 8 months ago (1 children)

Sure, but hosting the wiki itself has a cost.

[–] kogasa@programming.dev 34 points 8 months ago (4 children)

I have read programs a lot shorter than 500 lines which I don't have the expertise to write.

[–] kogasa@programming.dev 32 points 8 months ago

I dunno, but the last season takes a hard left turn with one major character leaving the pd for ethical reasons and the others struggling with their part in the institution. It was definitely informed by current events.

[–] kogasa@programming.dev 6 points 8 months ago

I worked with Progress via an ERP that had been untouched and unsupported for almost 20 years. Damn easy to break stuff, more footguns than SQL somehow

[–] kogasa@programming.dev 36 points 8 months ago* (last edited 8 months ago) (1 children)

This has nothing to do with Windows or Linux. Crowdstrike has in fact broken Linux installs in a fairly similar way before.

[–] kogasa@programming.dev 14 points 8 months ago (2 children)

Sure, throw people in jail who haven't committed a crime, that'll fix all kinds of systemic issues

[–] kogasa@programming.dev 17 points 8 months ago

Catch and then what? Return to what?

[–] kogasa@programming.dev 1 points 8 months ago

Just explaining that the limitations of Gödel's theorems are mostly formal in nature. If they are applicable, the more likely case of incompleteness (as opposed to inconsistency) is not really a problem.

[–] kogasa@programming.dev 2 points 8 months ago

Dunno what you're trying to say. Yes, if ZFC is inconsistent it would be an issue, but in the unlikely event this is discovered, it would be overwhelmingly probable that a similar set of axioms could be used in a way which is transparent to the vast majority of mathematics. Incompleteness is more likely and less of an issue.

[–] kogasa@programming.dev 1 points 8 months ago (2 children)

It's extremely unlikely given the pathological nature of all known unprovable statements. And those are useless, even to mathematicians.

[–] kogasa@programming.dev 3 points 8 months ago (6 children)

Nobody is practically concerned with the "incompleteness" aspect of Gödel's theorems. The unprovable statements are so pathological/contrived that it doesn't appear to suggest any practical statement might be unprovable. Consistency is obviously more important. Sufficiently weak systems may also not be limited by the incompleteness theorems, i.e. they can be proved both complete and consistent.

view more: ‹ prev next ›