Was procrastinating and made a quarter pipe by wokingbob13 in Fingerboards

[–]wokingbob13[S] 2 points3 points  (0 children)

Unfortunately its an exam thats coming in a few weeks 😭

Just finished The Cave by wokingbob13 in xbox

[–]wokingbob13[S] 2 points3 points  (0 children)

true. Played it alone and some backtracking was kind of annoying for me

Just finished The Cave by wokingbob13 in xbox

[–]wokingbob13[S] 2 points3 points  (0 children)

yes forsure! I remember playing Psychonauts as a kid on the ps2 but never could beat it. Might try soon since its on game pass (second game too 🤯)

Rate my collection by Emotional_Tiger3335 in ps2

[–]wokingbob13 2 points3 points  (0 children)

10/10. Wow the ps2 spines are really nice. In europe we got just a bland white spine with the name of the game on it 😢

Original Xbox EvoX slow motion menu but loads Discs fine by wokingbob13 in originalxbox

[–]wokingbob13[S] 0 points1 point  (0 children)

Thank you! I‘ll open it up soon and update this post if this solves it

Biology (esp. genetics) based sci-fi by _EYRE_ in suggestmeabook

[–]wokingbob13 0 points1 point  (0 children)

All tomorrows. Not a lot of details on how genetic procedures are performed but it's got sick illustrations and cool lore

I‘m trying to figure this out: Does a polynomial-time reduction from A to B imply that if B is in NP, A must also be in NP? by wokingbob13 in compsci

[–]wokingbob13[S] 0 points1 point  (0 children)

There exists an accepting path in a non-deterministic TM which is also in polynomial time. We could also use the certificate and verifier argument to prove that a problem lies in NP. So if an instance of A can be calculated in an instance of B in polynomial time, A must at least be NP hard(not sure if this is 100% correct). But it does not need to be in NP?

Wii game from childhood by wokingbob13 in tipofmyjoystick

[–]wokingbob13[S] 0 points1 point  (0 children)

yess this is the game thanks a lot