
Tiago Campos
@Tiagocamposfer
Followers
45
Following
781
Media
14
Statuses
389
Information System - UFVJM. UFMG graduate cc student. Eng / Pt-Br, but mostly in English.
Joined July 2018
Entender a teoria de Darwin com simplicidade é apenas burrice ou ignorância.
0
0
0
No entanto, isso converte para um sistema complexo. Que claramente não é tão simples como “sobrevivência “. De fato a teoria de Darwin poderia convergir para algo completamente contrário, apenas é *apenas* sobrevivência sempre foi o critério de maior seleção.
1
0
0
A galera deveria entender que Darwin disse que as características que fomentam a sobrevivência *por razões óbvias* tendem a ser selecionados por mutuação.
1
0
0
Initially, I thought that sat solvers were simply engines to formalize, they are painful :C .
0
0
2
As the author of this PDF, it's been interesting seeing people guess at the rationale behind its design. However, the rationale had nothing to do with theory vs practice, and everything to do with pragmatically coping with an unaccommodated disability in academia. (1/16)
Compilers was was known to be the hardest CS class at Cornell which was hard as it is. We were handed a 8-page PDF at the start of sem for a language spec we'd be implementing by the end of sem, split into 6 parts. On part 5, the median was a 0/100 and most the class failed.
127
2K
17K
being in a relationship with me would be peaceful because I'm a simple person to gift. no need to stress out searching something I'll like. just buy me a cluster of 65,536 mac minis and I'll be entirely happy. can't go wrong with me
20
7
255
For god sake, who thought dependent types plus predicate logic would be a good ideia?
0
0
2
RIP
0
0
0
"If φ is a propositional formula, then φ is a classical tautology if and only if ¬¬φ is an intuitionistic tautology."
0
0
2
Logic always has been about taking out things rather than putting things. Probably due to the scenario of 90s math that went to an exhaustive approach to formalize everything using an X set of axioms to more decentralized logic systems.
0
0
1
So in the end a syntactic termination checker relies more upon semantics than we think at first.
1
0
0
When we have (P -> Acc) -> Acc, and P has more than one inhabited, we still conclude that Acc is the valid inductive definition, but now the decreasing argument of Acc can have more than one direct inhabitant. This is the magic of well-founded recursion.
1
0
0