Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
daneelsan
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
1.
▲
by
daneelsan
4y ago
In Mathematica/Wolfram Languege, the part 0 of an expression is reserved for the head of the expression: f[x, y, z][[0]] == f. Or g[f][x, y][[0, 1]] == f.
2.
▲
by
daneelsan
4y ago
Scott's thots part 2
3.
▲
by
daneelsan
4y ago
And just now console.log() :) https://github.com/daneelsan/zig-wasm-logger
4.
▲
by
daneelsan
4y ago
I am also trying to learn wasm via the zig route: * A minimal example showing how HTML5's canvas, wasm memory and zig can interact: https://github.com/daneelsan/minimal-zig-wasm-canvas * This mini game shows how Z
5.
▲
by
daneelsan
4y ago
My goto right now is to listen to One Piece OST.
6.
▲
The Making of a New Kind of Science
(writings.stephenwolfram.com)
2 points
by
daneelsan
4y ago
|
0 comments
7.
▲
by
daneelsan
4y ago
There is a difference between online education because there is no other way as there is a pandemic (are the students and the institution ready to switch to online, are the courses even designed to be imparted online, etc.), and online educ
8.
▲
by
daneelsan
4y ago
OK bud
9.
▲
by
daneelsan
4y ago
Would it be profitable, though?
10.
▲
by
daneelsan
4y ago
I'm not sure why comments mention CA. His physics theory and the multicomputation stuff does not make use of CA's (at least no more than any other abstract machine).
11.
▲
by
daneelsan
4y ago
Didn't he invent a numbering schema for classifying CA? That should count as an achievement.
12.
▲
by
daneelsan
4y ago
> it's nothing more than noodling cellular automata in ways that have had no effect whatsoever on chemistry, physics, or biology. I mean, you could at least read a bit about what his Multicomputation stuff is really studying. CA are
13.
▲
Quantum Computing in Wolfram Language
(wolframcloud.com)
1 points
by
daneelsan
5y ago
|
0 comments
14.
▲
by
daneelsan
5y ago
Yes
15.
▲
by
daneelsan
5y ago
Simple rules do not necessarily mean simple behavior. Explore where observation leads in various different systems and rules.
16.
▲
by
daneelsan
5y ago
Interesting...
17.
▲
by
daneelsan
5y ago
I see what you mean, simpler indeed!
18.
▲
by
daneelsan
5y ago
It has GC, e.g. DataStructures ( https://reference.wolfram.com/language/guide/DataStructures.... ) are GC'd. IIRC it uses refcounting for this.
19.
▲
by
daneelsan
5y ago
Tom is the current main developer of the new Wolfram Compiler. Search in YouTube "wolfram compiler" and you'll see almost all the talks are his.
20.
▲
The Design and Implementation of the Wolfram Language Compiler (2020) [pdf]
(dakkak.dev)
145 points
by
daneelsan
5y ago
|
18 comments
21.
▲
by
daneelsan
5y ago
Yeah, I do want some kind of defer.
22.
▲
by
daneelsan
5y ago
Some say they don't like it because it it's implicit control flow, i.e. I don't like that my code is being put into the end of the function without it being in the end of the function. I mean OK, but that's what for loop
23.
▲
by
daneelsan
5y ago
Huh that's a good point.
24.
▲
by
daneelsan
5y ago
Why ado you think namespaces make it a no brainer? I would argue the only thing I would want from C++ it's operator overloading, and I'm not even conviced about that.
25.
▲
Charting a Course for “Complexity”: Metamodeling, Ruliology and More
(writings.stephenwolfram.com)
25 points
by
daneelsan
5y ago
|
7 comments
26.
▲
by
daneelsan
5y ago
That sounds really interesting!
27.
▲
by
daneelsan
5y ago
That seems like the thing I'm looking for! Thanks for the info
28.
▲
by
daneelsan
5y ago
I guess that can be solved by creating an Expression type
29.
▲
by
daneelsan
5y ago
Yes. At some point i encountered this trie with payloads (which would act as t he field values).
30.
▲
by
daneelsan
5y ago
Sorry if I wasn't clear enough. Yes I want something like an object in javascript, like a struct in C but at runtime. But I want to implement this myself. At first I thought a hash table was the right choice. But I don't need the
More ›