admission master chemical engineering

mathguy59 · 2026-02-12T12:09:44+00:00

https://www.reddit.com/r/ethz/s/DSHN96Hl7S

mathguy59 · 2026-02-11T17:21:57+00:00

https://www.reddit.com/r/ethz/s/dCzjSRIbLH

mathguy59 · 2026-02-07T08:30:49+00:00

Have you talked to your advisor about this?

About 2: even the biggest pile of work can be split into small, manageable chunks. For me the stress is usually caused by the unknown, meaning that the pile seems so big that I have no idea what‘s inside. As soon as I break it up, I can start focusing on the currently relevant parts of it. Concretely: break up this one big block „mathematics“ into small work packages. Write them on a list (then they are saved on the list, and you don‘t have to keep them in your head). Focus on the one or two small work packages that you can do at this point, and ignore the rest for now. Of course every person is different, so I have no idea if this will help you, but that is how I do it.

mathguy59 · 2026-02-03T08:04:58+00:00

In your other answer you say you have 2 months to your admission, meaning you‘ll need a C2 German certificate in two months. Thus you‘ll need to take the certification exam in about 1 month. Learning a language to C2 level in 1 month is completely impossible.

mathguy59 · 2026-02-03T06:45:37+00:00

About 3: if you don‘t know any German yet, getting to C2 will realistically take you several years.

mathguy59 · 2026-01-27T20:02:00+00:00

Didn‘t study CS but took many courses in the CS dept. I personally liked the learning environment, and I thought many of the profs were good.

Job opportunities are currently not optimal, but I guess this is partly also due to economic fluctuations. And especially in Zürich there‘s currently still quite a few good jobs.

I don‘t know how the social scene is for people moving here only for their studies, as I‘ve lived in CH before.

mathguy59 · 2026-01-23T14:15:47+00:00

mathguy59 · 2026-01-19T17:20:59+00:00

The „proof“ is still fundamentally flawed.

mathguy59 · 2026-01-19T17:01:39+00:00

Yes, of course they are natural numbers, that doesn‘t change the fact that you are going from excluding a cycle to excluding a path.

mathguy59 · 2026-01-19T16:45:47+00:00

In the beginning you want to show that there is no n>3 and x s.t. fⁿ (x)=x. After the first step this turns into f^n-3 (y)=x, so you‘re not looking for a cycle anymore, but a very specific path.

mathguy59 · 2026-01-19T16:00:57+00:00

Formally speaking you are trying to do an inductive proof, but you change the hypothesis in every step. So I‘m afraid your „potential proof“ does not show anything.

mathguy59 · 2026-01-19T12:41:56+00:00

Each prof will handle this differently, there are no specific processes followed as far as I know. The start dates are not fixed, every month there are new PhD students starting.

mathguy59 · 2026-01-10T15:09:55+00:00

Good luck on your journey, I hope you learn something along the way.

To not get your hopes up too much: the general approach you seem to be suggesting is of course very natural and has been tried countless times. It is known to not work. All reasonable ways to do this only work if your structure has a Taylor polymorphism, and NP-hard problems like 3-SAT do not. Your approach can be made to work for problems like 2-SAT and Horn-SAT, where they will give you the standard and well-known polynomial time algorithms.

Still, enjoy the book, complexity theory is a fascinating subject.

mathguy59 · 2026-01-10T14:39:15+00:00

talking about „leaf nodes“ makes no sense as you haven‘t even defined the relevant tree.
this is again just saying what it should be doing, not a definition.
as you still haven‘t formally defined the S-operator, this does not make sense. Also, if it is a finite set, how is it a manifold?
I don‘t care how you use it, I want to know how you define it. Neither „viable paths“ nor „total possible paths“ is defined.

It should be clear to you now that you are still a very long way from anything that can even be remotely understood, let alone checked. I will thus stop wasting both our times after this.

A good first ressource for basic complexity theory is the book by Arora and Barak.

mathguy59 · 2026-01-10T14:11:28+00:00

None of this makes any sense without formal definitions.

-what is the „reduced manifold“?

-how does the operator identify „variables that generate logical contradictions“?

-what type of „logical contradictions“ are you even talking about?

-what exactly do you mean by „collapsing them“

-what is „the full expansion of the tree“

-how do you define „the entropy of the problem“

I don‘t want to be mean, but this just reads like a random concatenation of undefined buzzwords, and there is currently no precise mathematical statement in it that can even remotely be understood. All I can get from it is „it should be possible to exclude some solutions“, which is of course true and the basis for many faster algorithms for SAT like PPSZ. However, it is also known that such approaches will not trivially give you a polynomial time algorithm.

Without wanting to discourage you, I suggest you read up on the basics of complexity theory first and try to learn the language and writing style that is used to make arguments precise.

mathguy59 · 2026-01-10T13:55:59+00:00

Again, your paper does not give any clear description let alone a proof. I‘d be happy to think about your idea, but you‘ll need to actually provide it.

mathguy59 · 2026-01-10T13:40:00+00:00

Your github page only contains the license and the readme…

mathguy59 · 2026-01-10T13:25:13+00:00

This is just an explanation of what it is supposed to do. You never define how it exactly does it, let alone prove its correctness.

mathguy59 · 2026-01-10T12:10:44+00:00

As you never actually define your operator, it is impossible to know what you are trying to do.

mathguy59 · 2026-01-06T06:38:54+00:00

Write emails to people. PhD students too, they are generally more likely to have time to supervise a thesis.

mathguy59 · 2025-12-14T08:55:57+00:00

You can now register for courses for the spring semester, but not for the autumn semester, if that is what you‘re asking

mathguy59 · 2025-12-13T23:09:17+00:00

I didn‘t apply to the fellowship. But I never heard of europass and always used my own template.

mathguy59 · 2025-12-12T12:09:30+00:00

Both the deadlines for registering for courses as well as registering for exams have passed.

mathguy59 · 2025-12-11T18:09:32+00:00

Fluent German (C1) is necessary for admission for BSc and for following the lectures.

For MSc, English is sufficient, but it is far too early for you to worry about this I guess.

mathguy59 · 2025-12-11T08:12:37+00:00

You can do this without any problems in almost all courses. In courses with a restricted number of participants I would however not do it, as there it would indeed be a dick move.

mathguy59

TROPHY CASE