pratikdeoghare

7 ms·

1.
by pratikdeoghare 1mo ago
> According to a strengthening of the theorem, every finite point set (not all on one line) has at least a linear number of ordinary lines. An algorithm can find an ordinary line in a set of n points in time O(n log n). [1] There are man
2.
by pratikdeoghare 2mo ago
Shut up and learn Common Lisp using Practical Common Lisp. This would be my advice. Why? My own road was haphazard. Other books broaden your mind and teach you really cool tricks. This book gets you using lisp like you would say golang. But
3.
by pratikdeoghare 2mo ago
> but rather prompting very small tasks after you have made the initial design, something along the lines of "Create a database migration that adds column [x], not null", "add a field to the this form that will accept stri
4.
by pratikdeoghare 2mo ago
I suspect some companies do this to look healthy from outside.
5.
by pratikdeoghare 2mo ago
If you use Brashtag notation you could insert #tk{} bag. https://github.com/pratikdeoghare/brashtag
6.
by pratikdeoghare 2mo ago
> just glorified front-ends for BibTeX These frontends are necessary however because researchers in non-computer related fields are not trained/proficient at command line tools. Many of them need help installing software. Many of th
7.
by pratikdeoghare 3mo ago
Totally. After studying few hundred words of Spanish, German and French I thought hmm maybe a way to level up English is to learn basics of other languages. For example Fenster is Window in German. Defenestration becomes easy guess.
8.
by pratikdeoghare 3mo ago
Gell-Mann Amnesia effect https://en.wiktionary.org/wiki/Gell-Mann_Amnesia_effect
9.
by pratikdeoghare 3mo ago
When studying distributed systems you have to convince yourself that clocks cannot be relied on. It is hard to do so because all the clocks around me are always working just fine. When this article was posted here earlier I got an idea that
10.
by pratikdeoghare 4mo ago
> making an editor or you could come up with a notation that works in any editor. I have [1]. > That way you can easily try different ways without deleting any text. Sorry I haven't yet read your story. Here is how I would explor
11.
by pratikdeoghare 4mo ago
Having such a list is great. I am all for such lists. BUT Some people memorize these things. Take them too seriously. You are thought stupid if you don't know them. Somewhere someone then makes a story on Jira to verify that your produ
12.
by pratikdeoghare 4mo ago
There is one in golang regular expressions https://swtch.com/~rsc/regexp/regexp2.html I guess that is why you say re.Compile.
13.
by pratikdeoghare 4mo ago
You might like what I made for myself https://github.com/pratikdeoghare/brashtag
14.
Show HN: Brashtag – A notation for writing trees and a parser for it(github.com)
1 points by pratikdeoghare 4mo ago|0 comments
15.
by pratikdeoghare 4mo ago
I use a text file. But I use my own format. #todo, p1{ Get vaccinated. } https://github.com/PratikDeoghare/brashtag
16.
Syllogisms Made Easy(youtube.com)
3 points by pratikdeoghare 5mo ago|0 comments
17.
by pratikdeoghare 5mo ago
What I do is use a hash function to derive port number from service name.
18.
Principia Softwarica: Fundamental Literate System Programs(principia-softwarica.org)
33 points by pratikdeoghare 5mo ago|3 comments
19.
by pratikdeoghare 5mo ago
https://norvig.github.io/paip-lisp/#/ Really great book even if don’t care about lisp or ai.
20.
by pratikdeoghare 8mo ago
I faced this problem when designing my own notation [1]. Solved it by surrounding code with more ticks than maximum number of consecutive ticks inside its text. This allows arbitrary nesting. Postgres solves it by using `$something$ whateve
21.
by pratikdeoghare 8mo ago
https://pratik.deoghare.com/ https://pratikdeoghare.github.io/
22.
by pratikdeoghare 1y ago
I also use a single text file. I have developed my own notation to give it some structure [1]. I have a parser for the notation that creates tree of the document. Then I write various programs that walk the tree and do cool things. I have b