Saturated Fat Controversy

[FlatAssembler]

Is it someone else's problem that you're not interested in an answer to the question you asked?

Go do your own homework, or honestly, don't.  No one cares.  It won't be hard, I know this, because I had to look up Nina Teicholz.  The info you want is right there, no digging required, it's how I know you never did any research of your own.

I've done plenty of research on my own. I've made this compiler before entering the university, having researched everything needed for it by myself. And the same goes for the PacMan game I've made, I haven't even modified it after entering the university: I've researched that all by myself, alongside attending a boring grammar school.
It's not hard to find people positively reviewing Nina Teicholz'es work, but I'm having trouble finding an actual nutritionist reviewing it.

[The Grand Nudger]

Making a compiler is researching the footnotes and studies detailed in the claim you're asking about...how...exactly?

I'm seeing a pattern here, in every discussion we've had in thread. The things you're wondering about are very easily found. Why don't you give google a whirl?

[FlatAssembler]

Making a compiler is researching the footnotes and studies detailed in the claim you're asking about...how...exactly?

You said that you think I've never done any complicated research by myself. Well, the research needed to make a compiler is rather complicated: the information about Assembly language, anything beyond the very basics, isn't at all easy to find.

I'm seeing a pattern here, in every discussion we've had in thread. The things you're wondering about are very easily found. Why don't you give google a whirl?

The truth is obvious: very few, if any, qualified nutritionists, think that saturated fat doesn't cause heart disease. And Nina Teicholz is, as you know if you have watched the video I made, also making a whole bunch of fringe claims which don't follow even if you assume saturated fats don't cause heart disease, among other things, that cow's milk (which contains a lot of calcium but little to no vitamin K) doesn't cause heart disease and that butter (containing a lot of trans-fat) doesn't cause heart disease. So, yeah, it's safe to assume no nutritionist agrees with Nina Teicholz.

[Abaddon_ire]

Yeah, you now realize you were wrong when you said Nina Teicholz was probably right about nutrition, so you simply change the topic. I’ve made this thread specifically about the saturated fat controversy, to see if there are indeed convincing arguments against saturated fat leading to heart disease… and it seems to me more and more that there aren’t.

Sure. There are. But those are based on science and research. You are stuck in a religion. The same religion as Nina. You have simply tossed the religion you were raised in and substituted a new one to fill the vacuum that you foolishly thought needed filling. Hint: That gap is false and need no filling at all.

All we have here is you swapping one religion for the next one. It happens to be veganism for you. It could as well have been "last Thursdayism". It would not matter. You have simply swapped one religion for whichever next religion seemed most popular to you at the time. 

When veganism falls out of favour, you will glom onto something else. Chakras, or auras, or some other idiotic belief system. And then you will gullibly swallow whatever those gurus feed you. And you will repeat that cycle until it finally dawns on you that all of it is BS. That realisation is not something that I or anyone else can gift to you. There is no way but the hard way. Good lick.

---

Is it someone else's problem that you're not interested in an answer to the question you asked?

Go do your own homework, or honestly, don't.  No one cares.  It won't be hard, I know this, because I had to look up Nina Teicholz.  The info you want is right there, no digging required, it's how I know you never did any research of your own.

I've done plenty of research on my own. I've made this compiler before entering the university, having researched everything needed for it by myself. And the same goes for the PacMan game I've made, I haven't even modified it after entering the university: I've researched that all by myself, alongside attending a boring grammar school.
It's not hard to find people positively reviewing Nina Teicholz'es work, but I'm having trouble finding an actual nutritionist reviewing it.

Nope. That is not a compiler in any way shape or form. I have taught assembler in various flavours to various classes and I know for a fact you are hurling bovine fecal matter.

PSA: All of these claims are false. 

Nobody should buy into this. FA is lying.

At best, FA has used some development tools that give results on an abstraction layer that is so far removed so as to be useless. Effectively, what FA is claiming is that he programmed a tic-tac-toe game on the intertubes and therefore he is qualified to run a Cray II which he has stored under his bed in mom's place.

Well fuck that. To this day, I continue to write encryption routines in assembler and in machine code. So that claim is out the window straight away.

Second, my code securely processes credit card transactions. Might even be yours for all I know. 
The level of security and data protection is scary. 

Nevertheless, FA seems blissfully unaware of any of it because who knows what might be happening in his strange head? 

I don't. Nobody here can.

All I can do is point out that this is an area of expertise for me, and everything FA has claimed is flat out wrong.

[FlatAssembler]

The same religion as Nina.

I don't think that's a fair description. To argue for veganism, you don't need to deny science. Slaughterhouse footage isn't science denial. Neither is saying that animal-derived food, on average, contains more carcinogens and more saturated fat and trans-fat than plant-derived foods. Saying that rise in diabetes was caused by us supposedly eating less and less meat, what Nina claims, well, that's denying science and common sense.

That is not a compiler in any way shape or form.

Why wouldn't it be? It can compile some programs written in my own programming language (called AEC), like, for example, this one. In that case it produces Assembly that's a few times slower than what GCC produces for the equivalent C code, but it translates from my own programming language into Assembly, so it is, indeed, a compiler.

At best, FA has used some development tools that give results on an abstraction layer that is so far removed so as to be useless

Well, yes, most of my compiler is written is JavaScript. But why would choosing to work in that language (which I happen to know the best) make that not real programming?
The compiling code is written by myself, here is a snippet of it:

Code:

function fasinp() //-||- arkus sinus (po formuli arctan(sin(x)/sqrt(1-sin(x)*sin(x))))
{
   asm("fstp dword [result]");
   asm("fld dword [result]");
   asm("fld1");
   asm("fld dword [result]")
   asm("fld dword [result]");
   fmulp();
   fsubp();
   fsqrt();
   fdivp();
   fatanp();
}
function facosp() // -||- arkus kosinus (po formuli pi/2-arcsin(x))
{
   asm("fstp dword [result]");
   asm("fldpi");
   asm("fld1");
   asm("fld1");
   faddp();
   fdivp();
   asm("fld dword [result]");
   fasinp();
   fsubp();
}

So is the parsing code, here is how I solved parsing the binary functions (inefficient, but the difference between Shunting-Yard and this is in the vast majority of the cases imperceptible):

Code:

for (var i = 0; i < arth.length; i++)
   if ((arth[i].text == "pow(" || arth[i].text == "atan2(" || arth[i].text=="mod(") && !arth[i].operands.length)
   {
       var c = 1;
       var j = 0;
       while (c)
       {
           j++;
           if (i + j >= arth.length)
           {
               alerted = 1;
               alert("Parser error: Expected a ',' to divide the arguments of a binary function.");
               return arth[0];
           }
           if (arth[i + j].text == ',')
               c--;
           else if (arth[i + j].text == "pow(" || arth[i + j].text == "atan2(" || arth[i + j].text == "mod(")
               c++;
       }
       var tmp = [];
       for (var k = 1; k < j; k++)
           tmp.push(arth[i + k].text);
       arth[i].operands.push(parseArth(tmp));
       var k = 0;
       c = 1;
       while (c)
       {
           k++;
           if (i + j + k >= arth.length)
           {
               alerted = 1;
               alert("Parser error: Expected a ')' to mark the end of the second argument of a binary function.");
               return arth[0];
           }
           if (arth[i + j + k].text == ')')
               c--;
           else if (arth[i + j + k].text.charAt(arth[i + j + k].text.length - 1) == '(')
               c++;
       }
       tmp = [];
       for (var l = 1; l < k; l++)
           tmp.push(arth[i + j + l].text);
       arth[i].operands.push(parseArth(tmp));
       arth.splice(i + 1, j + k);
       if (arth[i].text == "atan2(")
       {
           var tmp = Token("*");
           tmp.operands.push(Token(180 / Math.PI + ""));
           tmp.operands.push(arth[i]);
           arth[i] = tmp;
       }
   }

And so is the tokenizing code, here is the code I am using to detect if a number contains a character that doesn't belong to a number or has more than one decimal point:

Code:

if (ret[i].charAt(0) >= '0' && ret[i].charAt(0) <= '9')
{
   var decimal = 0;
   for (var j = 0; j < ret[i].length; j++)
   {
       if (decimal && ret[i].charAt(j) == '.' || (ret[i].charAt(j) < '0' || ret[i].charAt(j) > '9') && ret[i].charAt(j) != '.')
       {
           alert("Tokenizer error: Can't assign the type to the token \'" + ret[i] + "\'.");
           alerted = 1;
           return ret;
       } else if (!decimal && ret[i].charAt(j) == '.')
           decimal = 1;
}

In fact, this is entirely written by me.
And so is the code used for translating the while-loops, arrays and if-branches to assembly. Here is how "while" is translated to Assembly:

Code:

if (/^While/.test(str))
{
   var arth=str.substr("While ".length);
   var label1="l"+(Math.floor(Math.random()*1000000));
   stack.push(label1);
   asm(label1+":");
   parseArth(tokenizeArth(arth)).compile();
   var label2="l"+(Math.floor(Math.random()*1000000));
   asm("fistp dword [result]");
   asm("mov eax,[result]");
   asm("test eax,eax");
   asm("je "+label2);
   stack.push(label2);
}
else if (/^EndWhile/.test(str))
{
   var endWhileLabel=stack.pop();
   var whileLabel=stack.pop();
   asm("jmp "+whileLabel);
   asm(endWhileLabel+':');
}

That is also available on GitHub, it's the file "control.js" file in this ZIP-archive.

To this day, I continue to write encryption routines in assembler and in machine code.

Well, isn't that very unwise? It's important that the encryption software doesn't have many bugs, and programs written in Assembly and machine code (if there are such programs today) tend to be very buggy.

[LastPoet]

Any basic computer student knows how to do assembly. What this pertains to the discussion at hand is beyond me. I got 19/20 on comp architecture in my unfinished college course because I had to start the slaying pig course, hands in approach that one. Does this idiot even know how to make a efficienent NAND gate? His parents must be so proud...

Again, how his infantile prowess in CS gives authority in meat industry is beyond me. Perhaps dunning and kruger can explain that.

[FlatAssembler]

Any basic computer student knows how to do assembly.

No. And even those who do know basic Assembly don't know how to make a program that converts arithmetic expressions to Assembly.

What this pertains to the discussion at hand is beyond me.

Well, Gae Bolga claimed I had probably never done any complicated research by myself. Well, since I made that compiler before entering the university, alongside going to a boring grammar school with very little computer science, that proves I am more than capable of doing complicated research by myself.

I got 19/20 on comp architecture in my unfinished college course because I had to start the slaying pig course, hands in approach that one.

I doubt it. Had you been on a course, they would have probably told you that CO2 poisoning isn't painless, but that it's used because it may be less painful than electric bath (and that even that is controversial). And that pigs regaining consciousness after it is an exception, not a rule. What sorts of learning materials did they give you? I assume that, had you been on a course, you would have been given something like this.

Does this idiot even know how to make a efficienent NAND gate?

Well, not right now. On the university, we were told as a side-note that AND gate takes 6 transistors and that NOT gate takes 2 transistors. So, a naive implementation would obviously take 8 transistors. Now, I assume there is a way to make it using one or two transistors less. If I wanted to make something for which I'd need that for, I would do extensive research about that, just like I did the research about the stuff needed for that compiler.

[Abaddon_ire]

Any basic computer student knows how to do assembly.

No. And even those who do know basic Assembly don't know how to make a program that converts arithmetic expressions to Assembly.

What this pertains to the discussion at hand is beyond me.

Well, Gae Bolga claimed I had probably never done any complicated research by myself. Well, since I made that compiler before entering the university, alongside going to a boring grammar school with very little computer science, that proves I am more than capable of doing complicated research by myself.

I got 19/20 on comp architecture in my unfinished college course because I had to start the slaying pig course, hands in approach that one.

I doubt it. Had you been on a course, they would have probably told you that CO2 poisoning isn't painless, but that it's used because it may be less painful than electric bath (and that even that is controversial). And that pigs regaining consciousness after it is an exception, not a rule. What sorts of learning materials did they give you? I assume that, had you been on a course, you would have been given something like this.

Does this idiot even know how to make a efficienent NAND gate?

Well, not right now. On the university, we were told as a side-note that AND gate takes 6 transistors and that NOT gate takes 2 transistors. So, a naive implementation would obviously take 8 transistors. Now, I assume there is a way to make it using one or two transistors less. If I wanted to make something for which I'd need that for, I would do extensive research about that, just like I did the research about the stuff needed for that compiler.

A NAND gate takes two transistors. An AND gate take two diodes. WTF did you study?

[FlatAssembler]

No. And even those who do know basic Assembly don't know how to make a program that converts arithmetic expressions to Assembly.
Well, Gae Bolga claimed I had probably never done any complicated research by myself. Well, since I made that compiler before entering the university, alongside going to a boring grammar school with very little computer science, that proves I am more than capable of doing complicated research by myself.
I doubt it. Had you been on a course, they would have probably told you that CO2 poisoning isn't painless, but that it's used because it may be less painful than electric bath (and that even that is controversial). And that pigs regaining consciousness after it is an exception, not a rule. What sorts of learning materials did they give you? I assume that, had you been on a course, you would have been given something like this.
Well, not right now. On the university, we were told as a side-note that AND gate takes 6 transistors and that NOT gate takes 2 transistors. So, a naive implementation would obviously take 8 transistors. Now, I assume there is a way to make it using one or two transistors less. If I wanted to make something for which I'd need that for, I would do extensive research about that, just like I did the research about the stuff needed for that compiler.

A NAND gate takes two transistors. An AND gate take two diodes. WTF did you study?

I mean, so that they work reliably in a TTL circuit or a CMOS circuit, and that they can be easily inserted there in automatic procedures. You can't efficiently insert two diodes into a CPU when you need an AND gate there.
Now, what's the reason we aren't using that two-transistor solution when we need a NAND gate in a CPU, I don't know that on the top of my head, but I assume there is a very good reason why we use a 6-transistor AND gate rather than using two 2-transistor NAND gates.
You can't know everything from computer science on the top of your head. You need to know how to research what you need. And those things aren't really relevant to making a simple low-level programming language and a compiler for it, or for making a PacMan game playable on smartphones, or for anything else I've made yet.

[Abaddon_ire]

A NAND gate takes two transistors. An AND gate take two diodes. WTF did you study?

I mean, so that they work reliably in a TTL circuit or a CMOS circuit, and that they can be easily inserted there in automatic procedures. You can't efficiently insert two diodes into a CPU when you need an AND gate there.

There is no reason one cannot etch two diodes on a substrate.

Now, what's the reason we aren't using that two-transistor solution when we need a NAND gate in a CPU, I don't know that on the top of my head, but I assume there is a very good reason why we use a 6-transistor AND gate rather than using two 2-transistor NAND gates.

There is a reason why a less efficient 6 transistor structure MIGHT be chosen. Go learn stuff.

You can't know everything from computer science on the top of your head.

Sure, but that is no excuse for making crap up, is it?

You need to know how to research what you need.

Yet you consistently fail to do exactly that.

And those things aren't really relevant to making a simple low-level programming language and a compiler for it, or for making a PacMan game playable on smartphones, or for anything else I've made yet.

Or shitty amateurish websites apparently.