Readit News logoReadit News
kdkdk commented on Bob Lee, former CTO of Square, has died after being stabbed in San Francisco   sfgate.com/bayarea/articl... · Posted by u/rdl
peyton · 2 years ago
Downvoting for flame bait. Come on.
kdkdk · 2 years ago
It‘s not just the government. As SF controls ever larger part of the world, many power hungry people flock to SF. Prices go up and more people want a piece of the action.
kdkdk commented on Windows 11 KB5023778 update adds promotions to the Start menu   bleepingcomputer.com/news... · Posted by u/nazgulsenpai
kdkdk · 2 years ago
Let‘s gooo I want all the corporate companies to regret ever having used windows. They will be so vender locked that they will have to see advertisements every 10 minutes to continue using it without extra payments.
kdkdk commented on A formula for the nth digit of 𝜋 and 𝜋^n   arxiv.org/abs/2201.12601... · Posted by u/georgehill
sega_sai · 3 years ago
It is all curious, but it seems that procedure that calculates the n-th digit using some other functions that require O(n) calculations (i.e. Bernoulli numbers) is not that exciting, as it's just a speedup comparing to a naive calculation (maybe a big one but still).

Although because pi is a transcendental number maybe it is impossible to have an algorithm to return the n-th digit in O(1) operations? Does anyone know ?

Upd: thinking more about it, just to read all the digits of number n, one needs log(n) operations, so I guess anything that has performance of O(log(n)) can be considered easy (i.e. the digits of rational numbers can be computed in O(logn).

kdkdk · 3 years ago
Even rational numbers which have repeating digits at the end are not O(1) because in order to calculate the n-th digit you need to calculate n modulo k where k is the length until the number repeats its digits, which needs to read the entire input number n (thus runs in O(log(n)). The only exception are rational numbers with k being a power of two. Take 0.1010101010…, you can get the n-th digit by reading off the smallest digit of n and checking whether it is a 0 or a 1.

There are transcendental numbers where the n-th digit can be computed in O(log n) like Champerowne constant though.

kdkdk commented on Science without Validation in a World without Meaning   americanaffairsjournal.or... · Posted by u/nkurz
kdkdk · 5 years ago
I think the system the author is looking for is probabilistic programming. It allows you to write programs/models with uncertain factors. Then at the end you can observe a few variables and it automatically computes the expectation and variance all the input variables. Check out psisolver.org for example.

u/kdkdk

KarmaCake day0June 3, 2020View Original