Computer Science

« first day (1211 days earlier) ← previous day next day → last day (3524 days later) »

Rick Decker

00:10

@vzn There's a pumping lemma for CFLs, too.

4 hours later…

500_error

04:23

@Raphael I apologize for my outburst, It was a bit of a shock to realize I was so out of my depth here.

4 hours later…

Raphael

08:12

@MaryStar meta.cs.stackexchange.com/questions/599/…

@500_error Apology accepted, even though I don't understand how to get from "shock" to "lashing out". Anyway, I'll hope we'll communicate better in the future.

BuildingJarl

Hi all,

I am a computer science student and I am currently running an experiment for my PhD research. I would appreciate it if you could participate.

The experiment is about the comprehension of hierarchical relationships within source code. As a participant you will be presented with source code fragments within a text editor, and asked to complete a series of tasks. The tasks focus on the navigation and comprehension of the presented code fragments, which are written in HTML.

The experiment is very simple and will take you approximately 20 minutes to complete. However, currently mobile…

Bounty!

08:59

Q: scale-free networks and adjacency matrix

Given a distribution over graphs with $n$ nodes having the "scale-free" property, I would like to compute for a pair of vertices $(a,b)$ the probability that they are connected (or more precisely the probability that there is a directed edge from $a$ to $b$). Is it possible to have such probabil...

5 hours later…

babou

13:46

cs.stackexchange.com/revisions/44068/4 Is it known how it was managed by gsdfgdsfgdfg

cs.stackexchange.com/revisions/44068/4

Raphael

@babou They just edited their own question (and changed their username a little while later).

babou

14:08

@Raphael Sounds silly. It should be expected that this is easy to trace.

babou

14:19

cs.stackexchange.com/review/suggested-edits/25190

Raphael

@babou Yes. I guess it's not the people with affinity to reasoned action that elect to do this. ;)

@babou Reject, of course.

There are two types of self-vandalisers that I know: the rage-quit kiddie and the cheater.

To be fair, it's not immediately obvious that SE keeps all revisions. I don't know if they are indexed by search machines.

500_error

14:54

Suggestion on a book/biography or podcast with a historical perspective on CS theory. For Math I used "A brief history of Math from BBC" itunes.apple.com/us/podcast/brief-history-mathematics/…. The podcast explained what came before and after and also why it happened. Let me know if this is not a good question for this forum.

Rick Decker

15:53

@500_error It's probably not a good fit for the main site, but it's acceptable here. The problem, of course, is that not many people participate in CS chat, as you've likely noticed.

That said, I'm unaware of such a reference. It seems like an expository article that might appear in CACM or some similar venue.

vzn

16:32

chat is what you/ "we" make it. many ppl have participated over the years and there is a lot of dialog. at any given moment, the room may not be busy. also the chat generates no rep which is maybe why many avoid it :(

it sounds paradoxical but indeed, the top users of the site (& many other se sites) appear to be highly motivated by the "se-semi-tangible-imaginary points" & not other abstract/ idealistic aspects.

the gamification / Jeff Atwood

vzn

17:21

@500_error seems halfway decent to me for main site (maybe with more specific aspect(s)) but am not saying it wont get downvotes (or worse)

history

4 hours later…

user1667423

21:11

What is the simplest Turing-complete cyclic tag system?

vzn

22:01

@user1667423 maybe papers on that somewhere. try this to start (mentions simple tag system after top)

A: What are the simplest turing-complete systems?

The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect it is similar to Game of Life. Rule 110 is known to be Turing complete. This implies that, in principle, any calculati...