Rubix982

Lex Fridman And Chris Lattner: on Compilers, LLVM, Swift, TPU, and ML Accelerators - Notes

This is a textual summary and list of notes of the podcast 'Artificial Intelligence Podcast' by Lex Fridman, from the episode Chris Lattner: Compilers, LLVM, Swift, TPU, and ML Accelerators.

About Chris Lattner:

Currently senior director at Google, working for projects covering CPU, GPU accelerators for Tensorflow, Google's library for Machine and Deep Learning, also involved in Swift related projects  

What Were Your First Initial Stages?

Performed basic programming by read and copying code from books  Started with simple GWBase, QBasic, then transitioned to Pascal, C, C++, and so and so forth.

Rubix982

#include <bits/stdc++.h>
using namespace std;

int main(void)
{
  // Generates the value of the macro PI, without having to rely on an already existing macro in C++
  // Since the macro varies from compiler to compiler
  std::cout << "Value of PI: " << std::setprecision(20) << acos(-1) << std::endl;
  
  return 0;

Rubix982

#include <iostream>
using namespace std;

/* 
Find nth root of a value a, Code from 
https://www.quora.com/How-do-I-write-a-program-in-C-that-will-compute-the-nth-root-of-a-number-by-using-a-numerical-approximation-Newtons-Method-Calculations-must-be-based-on-just-square-and-or-cubic-roots
*/

double root ( double a, int n );
double IntPowFast( double x, int n );

Rubix982

#include "stdc++.h"
using namespace std;

// Gives back the number of digits in O(1) time

int main(void) {

    std::cout << "<------- START ------->" << "\n";
    for (int i = 1; i <= 50000; ++i) std::cout << (int) floor( 1 + log10( (double) i ) ) << " " << i << "\n";

Rubix982

#include <iostream>
#include <math.h>
#include <string>
using namespace std;

int main(void) {

    uint_fast64_t b, p;
    double start = 2;