nivertech

7 ms·

31.
by nivertech 6mo ago
Imagined vs discovered tasks The way to really figure out what needs to be done is to start doing real work. https://basecamp.com/shapeup/3.1-chapter-10#imagined-vs-disc... imagined tasks == Jira discove
32.
by nivertech 7mo ago
yes here voice mode != hands-off mode, so you can't DWC (Driving-While-Coding)
33.
by nivertech 7mo ago
Claude Code's /voice mode isn't very accurate comparing to other speech-to-text (e.g. Google Translate). Also it takes about 500ms to activate after you press SPACE, so the initial words are missed out. It took me some time t
34.
by nivertech 7mo ago
/ði ˈɡloʊbəl iˈliːt (ænd ˈɛvɹiˌwʌn ɛls) ʃʊd swɪtʃ tu fəˈniːmɪk ˈspɛlɪŋ/
35.
by nivertech 7mo ago
https://x.com/nivertech/status/2028456969330192386?s=46&t=2P...
36.
by nivertech 7mo ago
PHP is too high level for this task - might as well write Rust compiler in a Tiring Machine.
37.
by nivertech 7mo ago
That’s true for any software project - on average only 5% goes into developing of the first version, while 95% goes into continuous development, support, and maintenance.
38.
by nivertech 7mo ago
unsurprising, since they're also into Monoliths https://www.youtube.com/watch?v=cHWs3c3YNs4
39.
by nivertech 7mo ago
https://youtu.be/yVwVWD9ZrDw?t=166
40.
by nivertech 7mo ago
just use TSV instead of CSV by default
41.
by nivertech 7mo ago
There are also APL + Lisp variants, like April, or even q from kdb+/q (kinda like Lisp but without parens). --- The APL programming language (a subset thereof) compiling to Common Lisp. https://github.com/phantomics&#x2
42.
by nivertech 7mo ago
Om = Forth + Tcl ? We've already seen Forth + Lisp What's next? Lisp + Tcl ? Or maybe: Lisp + Forth + Tcl ? ;)
43.
by nivertech 7mo ago
So UUIDv∞ will be at least 536 bit long? And with group IDs, timestamp, etc. - 1024 bit long?
44.
by nivertech 7mo ago
Say “halting problem” without saying “halting problem” ;) There is a practical solution to it called “metering”, like gas mechanism in Ethereum’s EVM or cost calculation for complex GraphQL queries.
45.
by nivertech 7mo ago
A better solution would be first-class metaprogramming, like in Zig or LISP. Maybe with some subset which guarantees to halt (I.e. no unbounded loops, no recursion, no FFI, known input size, hard time limits, etc.)
46.
by nivertech 7mo ago
Not sure what Assembly gives you here. DSL is a much better option. You can even use graphviz/Mermaid/PlantUML for visual agentic workflows, instead of emulating them with ASSM-like branching instructions and flags.
47.
by nivertech 8mo ago
> Elixir and F# have |> but neither auto-traces. Using dbg/2 [1]: # In dbg_pipes.exs __ENV__.file |> String.split("/", trim: true) |> List.last() |> File.exists?() |> dbg() This cod
48.
by nivertech 8mo ago
Eventually "cryptocurrencies" will go back to what they really are: a digital collectibles or a video-game like entertainment, or kinda like digital escape rooms, or an alternative money for illegal or black/gray market acti
49.
by nivertech 8mo ago
> Why do stablecoins exist at all? For states: They quietly inflate the money supply by forking fiat, achieving monetary base expansion without the political cost of explicit money creation For issuers: They convert user deposits into
50.
by nivertech 8mo ago
1. s/The largest number representable in 64 bits/The widest set of numbers representable in 64 bits/ 2. Using a Turing machine to model a von Neumann machine looks exactly like a Rube Goldberg machine. It even resembles it [1
51.
by nivertech 8mo ago
That's similar to how kdb+/q represent nulls and infinities This is certainly pragmatic, although it breaks the math q type size q literal forms underlying integer value (encoding)
52.
by nivertech 8mo ago
The correct answer is: the largest number representable in 1 bit is any number (including +infinity and beyond). This article describing various Rube Goldberg machines, there is no need to agree on different ways of representing numbers wh
53.
by nivertech 10mo ago
For credits to not be considered a money substitute, they must be non-transferable, non-refundable, and have an expiration date. Without an expiration date, unused credits cannot be accounted for as revenue, but as a liquid asset similar to
54.
by nivertech 10mo ago
Thinking is communicating with yourself
55.
by nivertech 10mo ago
I think we're talking apples vs oranges. The thread was about economists, not quants. > There's no analytic solution to complex economic systems in practice. yes
56.
by nivertech 10mo ago
I agree that time isn’t an input in the economic system. Although, one can use either discrete or continuous time to simulate a complex economic system. Only simple closed form models take time as in input, e.g. compounded interest or Black
57.
by nivertech 11mo ago
I use symbolic links, and Claude Code often gets confused, requiring several iterations to understand that the CLAUDE.md file is actually a symbolic link to AGENTS.md, and that these are not two different, duplicate files The recommended ap
58.
Beads: A coding agent memory system(steve-yegge.medium.com)
19 points by nivertech 1y ago|1 comments
59.
by nivertech 1y ago
OK, but I think it's not up to the programming language designers to define mathematical properties of the operations on specific data types. I think the most pragmatic solution is to have 2 tiers: 1. use existing standards (i.e. IEEE
60.
by nivertech 1y ago
Call Stack isn't a zero-cost abstraction, it makes threads more heavy-weight than they should be. If you only need it for debugging, then maybe better instrumentation and observability is the answer.

More ›