Today I Learned

TIL, 2018-05-17, HOC, Turing complete.

Musings, JS

if (!error.status) {
  toast.error('Network problem.')
  return Promise.reject(error);

What is Turing Complete?


  • A TC system means a system in which a program can be written that will find an answer (no guarantees regarding runtime or memory).
  • A TC language is one that can perform any computation. The Church-Turing thesis states that any performable computation can be done by a Turing machine (a machine with infinite RAM and a finite ‘program’ that dictates when it should read, write, and move across that memory.

JavaScript Is Turing Complete— Explained


  • In computability theory, a system of data-manipulation rules is said to be Turing complete or computationally universal it it can be used to simulate any single-taped Turing machine.
  • Calculator: not a Turing machine, because it can only perform a small, pre-defined subset of calculations.
  • PowerPoint: A Turing machine (you can use auto-shapes and the click thing).

  • Serverspec is a thing?

This project is maintained by daryllxd