2
points
iamandoni
Joined 111 karma
Software @ Google
- iamandoni parentDo you take any measures to prevent link hallucination? And content grounding / attribution verification?
- Shadcn & Vercel have created https://v0.dev/ which is pretty incredible
- An alternative I’ve been enjoying is @tommertom’s Ionic port (+ Capacitor) for native integration: https://github.com/Tommertom/svelte-ionic-app
- I believe there is a fallacy in the analysis of SF vs neighboring counties. The author is comparing YoY change; however, if the adjacent counties have less baseline nominal crime the YoY change could be less while hiding the magnitude of crime in SF. The author also doesn’t differentiate the types of crime in the analysis which makes a substantial difference. This section is in reference to the lenient theft laws, whereas these numbers commingle that data with violent crime and all other crime. And lastly, COVID is an outlier year where the population of the city dwindled, there were massive store closures, & there was less opportunity for non violent crimes.
- I would advise you to think about how to make that value proposition proprietary and defensible. I’m not wholly convinced that offering interior design or offering whole-apartment bundles alone is something you could defend an incumbent from also providing. Although it does sound like your space-visualization technology might be a leg-up here.
Also note that there are several competitors from the other-side that provide whole furnished apartments for rent such as Blueground. You seem to be in between the “rent single pieces of furniture” and “rent a whole apartment” spaces and need to ensure that the space is carved out enough and the market is there.
Congrats for being accepted into YC! You now have a large journey ahead of you!
- I thought he brought up really good points about the politicization of current social networks. I miss the days of chronological feeds and only seeing posts of users in your circle. I think splitting up actual users and pages/groups you follow into two separate feeds will also help reduce the feedback loop Cuban talks about.
- 1 point
- 14 points
- 1 point
- This is a pretty cool browser game that uses device orientation and websockets: https://lightsaber.withgoogle.com
- As a correlation to this site, there is a secret programming challenge within google at: http://www.google.com/foobar/
You have to get invited to it (via searching the correct keywords, etc. I got invited when googling about dependency injection). It is a series of programming challenges that get really difficult. But after completing them, I got a final round interview at Google, which was pretty cool.
- I don't understand why there is a controversy at all here. This seems to at least have a logical use case, which is more than we can say for status code 418 (https://tools.ietf.org/html/rfc2324)
- I don't know if you're actually interested in the theory behind analyzing game complexity or just trying to be negative without doing your homework.
Classifying traversal and 2-D games is not a new thing, and they simply apply previous methodologies and proofs to classic Nintendo games. They do not do this via "proofs by obscurity" but rather by classical NP-Hard proofs built upon previous theorems. Specifically, I will point you to the following two papers on fundamentals of proving NP-Hardness of 2-D and traversal games respectively:
- http://link.springer.com/article/10.1007%2Fs00224-013-9497-5
- http://link.springer.com/chapter/10.1007%2F978-3-642-13122-6...
They chose the collection of games because of their relevance to the authors. They wanted to study classic Nintendo games. Other games have also been studied including some, if not all, of the games you mentioned. If you did your research, you would already know the answers to the complexity of games like Tetris or Pong.
If you're genuinely interested in the underlying proofs or the theory behind game complexity, I urge you to read through the papers and their citations first before jumping to conclusions.
- From the paper:
> For these games, we consider the decision problem of reachability: given a stage or dungeon, is it possible to reach the goal point t from the start point s? Our results apply to generalizations of the games where we only generalize the map size and leave all other mechanics of the games as they are in their original settings. Most of our NP-hardness proofs are by reduction from 3-SAT.
- 115 points
- 1 point