• ‣

• Software 1.0 easily automates what you can specify.

• Software 2.0 easily automates what you can verify.

  • Do we have a theory of infer the amount of data that is needed to learn to task?

The Theory of Re-presentability in Computation

• How should one constrain a representation?

• At the moment of instantiation, different strategies may be applied (e.g., rule-based, type-based, or schema-driven).

• I need a very deep reflection on representation in Computer Science.

• [ ] Technical Weakness:

  • [ ] Logarithm

• [ ] What is the relation between covariance and independence?

• [ ] How can we show that the correlation is always between -1 and 1?

• [ ] What do we mean when we say scaling a number? Let say we have numbers between 100 and 200; how to scale them to 0 and 10?

• [ ] These are operators; can be used to re-represented problems;

• [ ] W Lambert Function → It’s a way to represent a problem, it basically; extract information from the input.

  • [ ] The W is an operator.

• [ ] Logarithms

• [ ] Gamma function