Gehinnn

55 ms·

271.
A Compact but Comprehensive Networking Tutorial(youtube.com)
4 points by Gehinnn 7y ago|0 comments
272.
by Gehinnn 7y ago
This is true for feature driven projects where features are added on top of exiting code and only some existing code is changed. But you will have a very hard time merging two refactoring branches that both touch internal data structures.
273.
by Gehinnn 7y ago
How do you implement algorithms for real numbers if there uncountable many of them? There is always a real number your algorithm cannot read/process.
274.
by Gehinnn 7y ago
Thanks ;) It took me a great amount of effort to implement that tree widget as I had to combine absolute positioned svg elements with relative positioned divs to get that effect.
275.
by Gehinnn 7y ago
This reminds me very much of my debug visualizer extension for vs code: https://marketplace.visualstudio.com/items?itemName=hediet.d... We have different approaches though.
276.
by Gehinnn 7y ago
This is nice, thank you ;) I love the pop-up that appears when hovering on a reference. An internet archive integration would be nice!
277.
by Gehinnn 7y ago
Have you heard of neo2? They have 6 layers, one only for programming characters and one for navigation. It's super practical.
278.
by Gehinnn 7y ago
Does the fuzzer generate just random input or does it adapt the input to achieve maximum test coverage (e.g. using constraint solver)?
279.
by Gehinnn 7y ago
I liked your survey ;) It would be great if you could disclose (in a few days or so) how many visitors took part in it compared to how many people your site visited! I find your concept a little bit messy though (while your website design i
280.
by Gehinnn 7y ago
Yeah, you got the point ;) This however only works for problems where you can validate a solution in polynomial time. There is still the problem what happens when a solution does not exist. Even in this case, the algorithm must terminate in
281.
by Gehinnn 7y ago
Feel free to ping me on twitter (@hediet_dev) if you got stuck with typescript on your next project!
282.
by Gehinnn 7y ago
I don't know. You could also enumerate all proofs and check whether P is a proof that a turing machine T solves SAT in polytime (if P=NP, this requires a finite number of steps ^) and then run T. ^ It would be funny though if P=NP, but
283.
by Gehinnn 7y ago
How do you prove that something is faster than everything else? Was it already running in linear-time? There aren't many non-trivial lower bounds out there, and I think they all use one of three ideas (diagonalization, crossing sequenc
284.
by Gehinnn 7y ago
Actually, I don't know anymore where I read about this idea - if you find out, please let me know! I've added a description of the algorithm.
285.
by Gehinnn 7y ago
Before an unbeliever comments (as I would do myself if I wouldn't know the algorithm): This algorithm involves enumerating f(M, t) where M is the Gödel number of a turing machine T, t an integer and f the output of T after t steps on t
286.
by Gehinnn 7y ago
The godfather of a galatic algorithm is the known (!) algorithm that solves SAT in polytime. However, its runtime is only guaranteed to be in polytime, if someone guarantees that P = NP.
287.
by Gehinnn 7y ago
It took csc on my pc less than a second to disprove that that 3 pigeons fit into 2 pigeon holes. Iterating over 2^6=64 combinations shouldn't take that long.
288.
How to Stress the C# Compiler(blog.hediet.de)
3 points by Gehinnn 7y ago|2 comments
289.
by Gehinnn 7y ago
I need your help! If you like the idea of this extension, please express your interest in [1]! Without a proper API from VS Code, this Debug Visualizer cannot unfold its full potential. Right now, you need to install a forked debug adapter
290.
Show HN: A Multi Purpose Debug Visualizer for VS Code(marketplace.visualstudio.com)
6 points by Gehinnn 7y ago|1 comments
291.
by Gehinnn 7y ago
Also, from C# dev to C# dev, you definitely should check out TypeScript. Checks like this: if (parent !== null && !(parent instanceof Entity)) { throw new TypeError('parent must be an Entity instance or null'); } will
292.
by Gehinnn 7y ago
It would be awesome if you could provide an online demo! Also, you should check out the JS formatting guide (I can recommend you prettier). Your code looks like being written by an C# developer :D
293.
Show HN: Launch a debugger by adding a single line to any Node.js app(github.com)
1 points by Gehinnn 7y ago|0 comments
294.
by Gehinnn 7y ago
Looks nice, but I don't get the core ideas of why it is better than JSON schema or bson. I don't know whether I like the syntax - there are too few examples.
295.
by Gehinnn 7y ago
Nice ;) How come you use WebGL rather than e.g. SVG?
296.
by Gehinnn 7y ago
I meant to say "could", but referred to the halting problem of turing machines. The browser can clearly decide whether an arbitrary SVG program halts (the answer is always "yes"). If you can reduce every turing machine M
297.
by Gehinnn 7y ago
I wouldn't say this proves that SVG is turing complete. I don't see why a perfect (i.e. correct and complete) SVG interpreter could solve the halting problem using this idea. Computationally speaking, specifying each iteration man
298.
by Gehinnn 7y ago
I often find me searching for a package that does XYZ on npm and find just so many. But most of them are either badly designed (!!!), have bugs, no typings or just don't do what I would expect they do. The few good ones are just imposs
299.
by Gehinnn 7y ago
That looks nice! I would recommend you to host in on gh-pages though so that it still works even if you decide to take down your website.
300.
by Gehinnn 7y ago
> It's really bad when doing anything that requires exploration and research I wouldn't say that, I have an counterexample ([1]): It is clear what the refactoring (that is to be implemented) should do and how to state that ([2]

More ›