dpkendal

As a learner/non-native speaker of German, please don't abolish the only way to tell the vowel length of an unfamiliar word.

Did we read the same paragraph? The problem with his first thesis was that, though he presented a brilliant and original result, he didn’t show that he’d studied enough prior research.

Nothing to do with schmoozing, everything to do with scholarly integrity.

SEEKING FREELANCER (Remote or Berlin, Germany)

Abecedary Limited

We’re looking for someone to help us integrate SAML authentication into a Python/Flask web app (as a Service Provider, wanting to authenticate against IdPs). There is already a full authentication system in-place — all that needs doing is integration with SAML-based SSO.

Knowledge of Python or Flask is not needed but extensive experience of SAML — and, ideally, the UK Access Management Federation and/or comparable schemes around the world — will be needed.

Expected completion within 1–2 weeks.

Contact <[email protected]>.

> Freedom of speech is not freedom from criticism.

“Sorry, you wrote this and we don’t like it, therefore you’re not invited to this conference on an irrelevant topic” or “… therefore we’re not going to a conference to which you were invited” is not valid criticism of an idea.

Perl 6 uses rationals by default. They have the advantages of being base-agnostic, able to accurately represent any recurring digit expansion accurately regardless of eventual base, and also faster (since, especially if you normalize (convert to lowest terms) lazily, most operations are just a few integer instructions with no branching, looping, or bit-twiddling involved).

The difference is in how the result is converted to a string, not in how the result is produced.

The Unicode case-mapping algorithm is customizable by locale (e.g. uppercase i is İ in Turkish). A application which needed long s (for German Fraktur, for instance) could use a custom locale.

My mistake, I meant O(2 ^ n) indeed. Regardless, having exponential time complexity in terms of the regular expression (which is usually controlled by the programmer) where the processing is done at compile-time is much better than having exponential complexity in terms of the input string (which often comes from an untrusted source) where the processing is done at run-time.