Viewing profile — najdan33
najdan33
HN member- Joined
- Sat, Dec 31, 2022, 2:33 AM UTC
- HN karma
- 9
- Public activity
- 10 items
- HN profile
- View on Hacker News ↗
About najdan33
No profile information was provided.
Recent public activity
- story
-
comment
Comment #34467859
It would be interesting to see a list of what a small player (eg. small country) effectively needs to be able to bootstrap chip/IC production.
-
comment
Comment #34467154
> Cryptography rearranges power: it configures who can do what, from what. This makes cryptography an inherently political tool, and it confers on the field an intrinsically moral …
-
comment
Comment #34390947
You are right, I was wrong. If there's a way to evaluate each single yes/no question in a finite number of steps, then the set of all problems is decidable, since any question can …
-
comment
Comment #34389408
Thank you for suggesting this example. For the undecidable Diophantine equation Q=0 of n variables - I'm assuming that the fact that someone could hit a solution randomly (by rando…
-
comment
Comment #34389339
The spiral was discovered in 1963: > This construction was first made by Polish-American mathematician Stanislaw Ulam (1909-1986) in 1963 while doodling during a boring talk at a s…
- story
-
comment
Comment #34389243
Thanks for the answer, it helps piece together the puzzle. I believe there's a problem with this reasoning: > each concrete solution can be expressed in finite length in a formal l…
-
comment
Comment #34384038
Does there exist a set of yes/no problems such that: - there's no general algorithm that can solve an arbitrary problem from the set (the whole thing is undecidable) - each problem…
-
comment
Comment #34289551
This thought deserves some admiration: >Assume that bad technical decisions are made rationally, for reasons that are not apparent. It could be generalized: >Assume that acts or be…