▲ 92 ▼ You are a serf. You live in Alsace. You are a peasant. You need to give your fuckin' lord the grain. (thelemmy.club) submitted 4 months ago* (last edited 4 months ago) by Collatz_problem@hexbear.net to c/chapotraphouse@hexbear.net 18 comments fedilink hide all child comments
[–] Collatz_problem@hexbear.net [S] 34 points 4 months ago (1 child) It's 1320, obviously. permalink fedilink source parent hideshow 2 child comments replies: [–] mathemachristian@hexbear.net 23 points 4 months ago (1 child) Think you can solve the collatz problem before lothar collatz is even born? permalink fedilink source parent hideshow 2 child comments replies: [–] Collatz_problem@hexbear.net [S] 21 points 4 months ago* (last edited 4 months ago) (2 children) We haven't solved it yet, and I have a lot of doubts if it is even possible, because it is known that the general question of "determine if given Collatz-type sequence is unbounded" is equivalent to the halting problem. permalink fedilink source parent hideshow 4 child comments replies: [–] mathemachristian@hexbear.net 12 points 4 months ago* Just pull the plug lol how is the "halting" problem even real, like just stop?? permalink fedilink source parent [–] miz@hexbear.net 9 points 4 months ago rip to your computability theory but im built different permalink fedilink source parent
[–] mathemachristian@hexbear.net 23 points 4 months ago (1 child) Think you can solve the collatz problem before lothar collatz is even born? permalink fedilink source parent hideshow 2 child comments replies: [–] Collatz_problem@hexbear.net [S] 21 points 4 months ago* (last edited 4 months ago) (2 children) We haven't solved it yet, and I have a lot of doubts if it is even possible, because it is known that the general question of "determine if given Collatz-type sequence is unbounded" is equivalent to the halting problem. permalink fedilink source parent hideshow 4 child comments replies: [–] mathemachristian@hexbear.net 12 points 4 months ago* Just pull the plug lol how is the "halting" problem even real, like just stop?? permalink fedilink source parent [–] miz@hexbear.net 9 points 4 months ago rip to your computability theory but im built different permalink fedilink source parent
[–] Collatz_problem@hexbear.net [S] 21 points 4 months ago* (last edited 4 months ago) (2 children) We haven't solved it yet, and I have a lot of doubts if it is even possible, because it is known that the general question of "determine if given Collatz-type sequence is unbounded" is equivalent to the halting problem. permalink fedilink source parent hideshow 4 child comments replies: [–] mathemachristian@hexbear.net 12 points 4 months ago* Just pull the plug lol how is the "halting" problem even real, like just stop?? permalink fedilink source parent [–] miz@hexbear.net 9 points 4 months ago rip to your computability theory but im built different permalink fedilink source parent
[–] mathemachristian@hexbear.net 12 points 4 months ago* Just pull the plug lol how is the "halting" problem even real, like just stop?? permalink fedilink source parent
[–] miz@hexbear.net 9 points 4 months ago rip to your computability theory but im built different permalink fedilink source parent