• 43 Posts
  • 920 Comments
Joined 2 years ago
cake
Cake day: June 2nd, 2024

help-circle










  • bleistift2@sopuli.xyztomemes@lemmy.worldGarden of gethsemane
    link
    fedilink
    English
    arrow-up
    1
    ·
    edit-2
    22 days ago

    I took this introductory passage to be the current tradition. The quoted bible passage makes it look like more of a mandatory thing:

    [5] If brethren dwell together, and one of them die, and have no child […]; her husband’s brother shall go in unto her, and take her to him to wife, and perform the duty of a husband’s brother unto her.

    [7] And if the man like not to take his brother’s wife, then his brother’s wife shall go up to the gate unto the elders, and say: ‘My husband’s brother refuseth to raise up unto his brother a name in Israel; he will not perform the duty of a husband’s brother unto me.’

    [9] then shall his brother’s wife […] loose his shoe from off his foot, and spit in his face; and […] say: ‘So shall it be done unto the man that doth not build up his brother’s house.’

    Deuteronomy 25 (Modern English)



  • bleistift2@sopuli.xyztomemes@lemmy.worldGarden of gethsemane
    link
    fedilink
    English
    arrow-up
    6
    arrow-down
    1
    ·
    23 days ago

    Just because there were no Catholics, that doesn’t mean that people weren’t violating some divine law (people also call it “natural law”). And unless you have a very specific meaning of “sin” in mind, there were absolutely “things you shouldn’t do or God will be angry”. Religion didn’t start with Jesus.








  • Suppose the average person p0 has n acquaintances. Then a naive approach would say that each of p0’s acquaintances (call one of them p1) also has n acquaintances, leading p0 with n2 acquaintances of the second degree.

    However, in a social network, many of p1’s acquaintances are shared between p0 and p1. Let’s say that rn (1/nr≤1) of p1’s acquaintances are actually first-order acquaintances of p0. The lower limit for r is 1/n because naturally one of p1’s acquaintances is p0 themselves.

    This gives us n⋅(1−p)⋅n = n2⋅(1−p) as the number of second-degree acquaintances, if my math is mathing. Increase n for more extraverted people in the network, and increase p for more closely-knit networks.

    To model the headline X % know someone who knows, we solve 1 / [n2⋅(1−p)] ≥ x where x is X% expressed as a fraction. Plugging in n=100 and p = 1/10 (I pulled these numbers out of my ass) and X=20% we get 1 / [1002 ⋅ (1−.1))] = 1 / [ 10^4 ⋅ 0.9 ] = 1 / 900; again, if my math is mathing.

    So this headline is true if about 1 in 900 people are in a relationship with AI.