Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
man-and-laptop
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
13 ms
·
61.
▲
by
man-and-laptop
8y ago
Will anything be done about this problem? https://github.com/mpv-player/mpv/commit/1e70e82baa9193f6f02...
62.
▲
by
man-and-laptop
8y ago
This is where I got the VM analogy from: https://swtch.com/~rsc/regexp/regexp2.html My whole comment was about tenuous but interesting analogies, and whether they can lead to somewhere interesting.
63.
▲
by
man-and-laptop
8y ago
They are a virtual machine because the physical hardware can't be in more than one state at the same time. Representing an NFA as an assembly-type program makes it resemble something like the JVM, in that it looks like an assembly lang
64.
▲
by
man-and-laptop
8y ago
To clarify, the programming language in your link is BNF. Clearly, BNF is a more expressive language than regexp. I was actually thinking of differentiating whole programs. But still interesting.
65.
▲
by
man-and-laptop
8y ago
If regexps are understood as a kind of "baby" programming language, and the techniques for implementing it are understood as "baby" implementation techniques for more complete languages, does "differentiation"
66.
▲
by
man-and-laptop
8y ago
Apart from: - Its usage in black markets, like drugs and weapons. - Its usage as a speculative commodity. - Its usage as a hedge against hyperinflation. Those are current uses - and any one of them could grow much bigger. Conceivably,
67.
▲
by
man-and-laptop
8y ago
Interesting idea about Bitcoin being a "settlement system", as opposed to a payment system like Visa or Paypal. I think of Bitcoin as being a Gold 2.0. Reasons: 1. It's like gold, but it removes some of its technical shortcom
68.
▲
by
man-and-laptop
8y ago
The way your spaceship analogy works in TTE, is that the random real number would be some kind of radio source that gets listened to by the two ships. Also, the way TTE works, there are diminishing returns from listening to the radio source
69.
▲
by
man-and-laptop
8y ago
That's not necessary with Type 2 Theory. You work with the usual set of real numbers.
70.
▲
by
man-and-laptop
8y ago
Interesting. How many weight-lifters in general take steroids? I use creatine, the occasional whey shake. Progress is slow :(
71.
▲
by
man-and-laptop
8y ago
> There is at least some argument that under this model it's not the number which can't be computed, but the "is rational" function. That's how I see it. I think this perspective results in a rich and natural the
72.
▲
by
man-and-laptop
8y ago
Type 2 Turing Machines are a conservative model of computation. They are as realistic as Type 1 Machines. Both models involve an infinite tape. Your previous comment used the Turing Machine abstraction, so my response was entirely valid, su
73.
▲
by
man-and-laptop
8y ago
Replace the role of Turing Machines with Type 2 Turing Machines. Then it is possible. And it's got absolutely nothing to do with computable functions. [edit] The downvoters can't argue with facts. I am not deleting this commen
74.
▲
by
man-and-laptop
8y ago
> Now a funny think I said was "pick a random real number". Since the computable numbers are also a measure 0 subset of the real numbers, it's literally impossible to randomly pick a real number with a computer... I disput
75.
▲
by
man-and-laptop
8y ago
I think this wouldn't work, because you can prove intuitionistically that every finite set is "decidable" using the following ingredients: - An upper bound N on the size of the set. - A surjection f:[1,N] -> S where [1
76.
▲
by
man-and-laptop
8y ago
No. If a set A is finite, its elements are enumerable, and some property P is decidable, then (\forall x \in A) P(x) \vee ~P(x) is true even intuitionistically. A list of examples of "anti-classical" axioms: - All functions are
77.
▲
Pancake: Markdown & Pandoc for scientific writing
(github.com)
5 points
by
man-and-laptop
8y ago
|
0 comments
78.
▲
by
man-and-laptop
8y ago
Two interpretations of transpose: - Let <-,-> denote an inner product. Then <Au, v> = <u, A^T v> is a definition of the transpose operation. Proof: (Au)^T v = u^T A^T v = <u, A^T v> - The transpose maps a vector
79.
▲
by
man-and-laptop
8y ago
Doesn't OOP have the ontological problem: Does the knife cut the cheese, or does the cheese get cut by the knife? Formally: Is it knife.cut(cheese) or cheese.getCutBy(knife)? And why is the first argument (knife in the first instance o
80.
▲
by
man-and-laptop
8y ago
Amazing, thanks.
81.
▲
by
man-and-laptop
8y ago
OK, and where was I confused? e^X could also be defined by \lim_{N \to \infty}(I + X/N)^N for X a linear map. For my intuition, I find that better than your definition.
82.
▲
by
man-and-laptop
8y ago
I once had an interesting thought about the function e^x. I think this is a key idea in the theory of Lie groups. If the x in e^x = (1+x/N)^N is understood as some transformation, then e^x is essentially repeating an infinitesimal tran
83.
▲
by
man-and-laptop
8y ago
How is CORDIC different from e^x ~= (1+x/N)^N where N is a power of 2?
84.
▲
by
man-and-laptop
8y ago
People need to understand how computers work because they put a lot of trust and faith in their computers. At any time, the computer might be sending your financial details to a criminal, or taking pictures of you and sending that to a crim
85.
▲
by
man-and-laptop
8y ago
“Young man, in mathematics you don't understand things. You just get used to them.” -- John Von Neumann My approach to "understanding" (if that's the right word) the quaternions was to first memorise the various identiti
86.
▲
by
man-and-laptop
8y ago
https://github.com/cmuratori/meow_hash/blob/master/meow_hash... What do AESRotate(foo,bar) and AESMerge(foo,bar) do? [edit] So it's a simple cyclic rotation preceded by A.Q0 = _mm512_aesdec_epi128(A
87.
▲
by
man-and-laptop
8y ago
The Haredim do mainly speak Yiddish. They use Hebrew only in prayer and religious study.
88.
▲
by
man-and-laptop
8y ago
Epistemology is an interesting area of philosophy. It asks "How do I know whether something is true or not?" It interests me because while there's consensus on what's true in the hard sciences, there isn't any outsi
89.
▲
by
man-and-laptop
8y ago
You could say the same thing about Russian. Like German, it doesn't borrow very heavily from other languages; and a lot of the words are simple variations of each other with different prefixes and suffixes. It was even the Lingua Franc
90.
▲
by
man-and-laptop
8y ago
Off topic: If the article doesn't show even after you disable the adblocker, turn on the Reader mode.
More ›