Recent content by Coolphreak

this isn't my explanation, but I was just wondering what others thought: "Einstein's special theory of relativity showed that an object can be of two different sizes for two different people and that they can perceive the time between two events to have different duratoins. His General...

Let's say you have some type of simplicial complex that is made only of 2 simplices. What happens if all those 2 simplices are adjacent to a single edge (creating a type of book shape), so that this complex can only be embedded in dimensions 3+? Would this complex have the same 2nd betti number...

Recently, I've constantly been debating going into Academia, versus industry. First off, I absolutely love conducting research, and can't see myself not doing research. I know you can do research in industry...but it doesn't seem like it's the same. I want to have the freedom to spontaneously...

hmm...my code is written pretty well. I guess the only reason i want to know the complexity is just for the sake of knowing. I think i'll look more into profiling. thanks

hmm...ok I'm basically downloaded a library to do linear algebra computations for me, such as matrix manipulations and eigenvalues, and determinants, etc. Looking at the code for the eigenvalue decomposition and such...they seem quite tedious to calculate the growth rate at by hand. I don't...

hmm let's say if matrix multiplication was the first step of my algorithm, and only performed once, I would assign it time T_1. Let's say I have some loop, after the multiplication, which is performed n times. I would assign this nT_2. So, then I would just add them nT_2 + T_1. Wouldn't this...

So I'm writing a computer science paper and i had a few questions. I have created some algorithms; i see a lot of papers presented in the algorithm, theorem, proof layout. So, when i say algorithm x.x i basically describe what my algorithm? and when i have a theorem, is it basically saying that...

my algorithm mainly does a bunch of matrix manipulations..in a nutshell. I was thinking of maybe saying each step takes time T and go from there...How would you recast in the form of turing machine?

so even with self intersecting edges (non planar graphs), the first homology group can be correctly computed no matter the embedding dimension? As long as the chains are of the correct dimension?

Let's say I have a complex like this: http://img267.imageshack.us/img267/5606/nonplanarpfum9.th.png The original nodes are defined on the same plane, but the actual complex exists in 3 dimensions. If I want to find holes in the complex, would computing the 1st homology group work in this...

so, it would be acceptable to basically run a whole bunch of trials, at different inputs (maybe many trials per input size) and then plot it on a graph, do a curve fit, and get some idea of a function of how the algorithm scales?

well, I'm basically trying to determine how efficient an algorithm I wrote is, how it scales, etc...If there is any way to "experimentally" do this, that would be ideal, rather than doing it theoretically.

bump... is there any software i can use to maybe get a graph to predict how computing time and resources needed change as larger inputs are put in?

oh. do i < t then

would it work better if you did something like this?: int t; int v; t = console.readline(); for(i = 0; i i> t; i++) { v = a*t; print(v); t = t+5; } some of the commands aren't really what c# uses, but hopefully you'll get hte idea. the user inputs some time t, you execute a for...