Turing Complete

A system of data-manipulation rules is said to be Turing complete if it can be used to simulate any Turing Machine. A Turing Machine is a mathematical model of computation that defines an abstract machine which manipulates data based on a set of rules. The actual machine invented by Alan Turing in 1936 was based on a tape with symbols and a machine that scans it. The machine is also capable for writing symbols. This became an early version of a central processing unit. In simple words, a Turing complete system is one which you can write a program that can find an answer. A Turing Machine can solve any problem that can be coded. Most programming languages are Turing complete. Even software like Microsoft Excel and Powerpoint are Turing complete. A blockchain can be used to solve problems by embedding a scripting language that can utilize the distributed nature of a blockchain.

How to read a URL

The internet is built on 3 pillars: HTML, which is used to make web pages; HTTP which is used to send and receive information over the internet; and the URL.

URL Syntax

scheme: [ // [ userinfo@ ] host [ :port ] ] [ / ] [ path ] [ ?query ] [#fragment ]

  • Scheme is the protocol. In most cases it is either HTTP or HTTPS. It tells the browser what protocol to use to fetch the requested resource
  • User-info substring is optional. The substring is of the format username:password.
  • Host consists of the domain name. The web browser uses it to fetch the IP address that is hosting the web site. A DNS behaves like a look-up table to fetch the right IP address for the domain name.
  • Port number indicates which gate to use to communicate with the web server.
  • Path resolves a file within the web server.
  • Query is an essential component for dynamic web pages, which use this query to dynamically render a web page.
  • Fragment is a way to mark pages within an HTML page.


References


How the URL was built