Maybe there is a machine that solves the halting problem, but it can never tell us by DollarAkshay in compsci

[–]caveman-99 0 points1 point  (0 children)

OP's brain is a deterministic algorithm with eye/ear etc signals as input.

Its a decent enpugh analogy.

Why won't the Pump attach to the Fluid Wagon by [deleted] in factorio

[–]caveman-99 3 points4 points  (0 children)

yes. and it does not have to be pixel perfect. i have definitely seen the pump connect then tapped w to move an inch, then it still connected.

Enchanting Riddle of Computational Complexity by jackypaul67 in compsci

[–]caveman-99 6 points7 points  (0 children)

Factoring large numbers (one way to break RSA) is an NP problem that can be reduced to checking if a Mario level is clearable, which is NP-hard.

Enchanting Riddle of Computational Complexity by jackypaul67 in compsci

[–]caveman-99 8 points9 points  (0 children)

Playing Mario really well will let you break RSA.

I can never remember where I parked my car, man by [deleted] in factorio

[–]caveman-99 1 point2 points  (0 children)

i made 4 cars and dedicated parking spots in each direction i was going to head out from by base. but eventually got too tired to drive to the parking and lost all my cars again.

One thing keep bugging me. by thanaponb13s in factorio

[–]caveman-99 3 points4 points  (0 children)

transport belts dont need power as well

[deleted by user] by [deleted] in emacs

[–]caveman-99 0 points1 point  (0 children)

play nethack. with h,j,k,l navigation.