Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dhs
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
16 ms
·
121.
▲
by
dhs
17y ago
I did, and he didn't. I think Crawford has two problems: 1. He's not a good storyteller. 2. Stories you tell using a computer need to be rule-based if the computation is expected to have a (controlled/authored) effect on the story's meani
122.
▲
by
dhs
17y ago
Last I heard, the real-time kernel is not part of the current version of Ubuntu Studio. I tried it about a year ago, and it was unstable/crashed frequently. Switched to Ubuntu regular; been happy ever after. I like the Dust desktop theme.
123.
▲
by
dhs
17y ago
Whoever downvoted me has definitely not taken the time to figure it out.
124.
▲
by
dhs
17y ago
Thanks, you two. You made my day . Baby?
125.
▲
CRON-O-Meter is free, open source, and cross-platform dieting software
(spaz.ca)
9 points
by
dhs
17y ago
|
0 comments
126.
▲
by
dhs
17y ago
It's naming, plus some more: Turing never named his idealized entity a "Turing machine" - that was done by others. He claimed universality for the algorithmic "Universal Computing Machine" he defined, and proved it - for algorithms. Now Akl
127.
▲
by
dhs
17y ago
Right, oracle machines are - or can be interpreted as - interactive. However, whatever it is that oracles do - it's often called "hypercomputation" - they're not doing computation, in the sense that Turing used the term in "On computable nu
128.
▲
by
dhs
17y ago
Just to make sure, I searched for "interaction" in "On computable numbers...", and it's not in there. And, like I said, in the general case, interaction is "more powerful" than algorithm as often as it is "less powerful". Edit - Example: Yo
129.
▲
by
dhs
17y ago
Not in Germany. Seat reservation costs extra.
130.
▲
by
dhs
17y ago
Yes, interactive computation is proven to be - statistically - more powerful than algorithmic computation - sometimes. It's also "less powerful" some other times, and since it's not computable at which times interaction is "better", it's
131.
▲
by
dhs
17y ago
It is quite unreasonable to talk about variables that change with time in the context of a Turing machine. If a "Universal Computer" is one that deals with variables which change during the computation due to interaction, then it is not wha
132.
▲
by
dhs
17y ago
Turing's computer was an idealized human - to him, computers were humans who did computations for a living - who were granted infinite time and tape - that's the idealization - to solve exactly one problem. Anything that talks about "x prob
133.
▲
by
dhs
17y ago
Turing was simply describing what people do: in a math test, I give you a problem, you solve it - without cheating, that is, interacting with your environment - using an algorithm, you hand it back to me. He idealized what a human does - in
134.
▲
by
dhs
17y ago
I believe that "luck" alludes to one of them finding out that voters using an IPv6 address wouldn't be blocked (IPv4 sites got blocked if they voted for the same candidate more often than once every 13 seconds).
135.
▲
by
dhs
17y ago
It's a bit hard to read in the web format, so you might want to download it as a PDF: http://mags.acm.org/queue/20090203/templates/download_offlin...
136.
▲
by
dhs
18y ago
To me, the primary value of my individual vote is its role in keeping the democratic process running. If I wouldn't vote, I would contribute to undermining the system I support. Contrastingly, the less other people vote, the more important
137.
▲
by
dhs
18y ago
I think I do understand most of the technicalities, using Gregory Chaitin's ideas about the properties of self-delimiting programs as a bridge. What I don't get is what I percieve of as the insistence on "surprises" in the "universe of inte
138.
▲
by
dhs
18y ago
I don't understand this. If the multiverse is a system of a certain (appearantly low) complexity, it should not be allowed to have sub-systems like the "universe of interest" which have a higher complexity. Also, I don't see why the informa
139.
▲
by
dhs
18y ago
I'm from Germany. I had no idea what we've been missing.
140.
▲
by
dhs
18y ago
There's a Wikipedia page about the song, which dates it at 1959, in contrast to the preface of the animation. http://en.wikipedia.org/wiki/Elements_song
141.
▲
Song & Animation featuring all Elements of the Periodic Table discovered until 1955
(privatehand.com)
7 points
by
dhs
18y ago
|
4 comments
142.
▲
Steve Jobs poaches IBM chip and blade geek
(theregister.co.uk)
3 points
by
dhs
18y ago
|
0 comments
143.
▲
by
dhs
18y ago
More browsers, more market split... As we saw with the example of search engines, a new competitor may split an existing market, only to have it later converge on his product, because he made something people liked. If they manage to do t
144.
▲
by
dhs
18y ago
Correction: The "cut off their air supply" quote was attributed to MS executive Paul Maritz, not to Bill Gates, by Steve McGeady from Intel. Maritz later denied having said it < http://www.wpi.edu/News/TechNews/990126/microsoft.html &#
145.
▲
by
dhs
18y ago
It's supposed to commoditize Windows (or any other OS), making it irrelevant. The idea is that the user only ever sees the UI of the Browser, and forgets what Windows even looks like, so that you can swap it against any other OS without the
146.
▲
Anatomy of a malware scam
(theregister.co.uk)
1 points
by
dhs
18y ago
|
0 comments
147.
▲
CIA Textbook on Psychological Operations In Guerrilla Warfare
(tscm.com)
1 points
by
dhs
18y ago
|
0 comments
148.
▲
The Decline of Women in Computer Science
(knol.google.com)
20 points
by
dhs
18y ago
|
12 comments
149.
▲
by
dhs
18y ago
No, a computer cannot do it, due to incompleteness (Once there was a man called Kurt Gödel...) Bringsjords experiment proves that humans can "hypercompute" uncomputable functions. The great majority of functions which exist are uncomputable
150.
▲
by
dhs
18y ago
A Turing Machine is an idealized computer. But no computer/TM can find out which of the possible 61.519 4-state TMs can write the longest string of 1's on a blank tape before halting.
More ›