How simple can a programming language be?

preview_player
Показать описание
Most programming languages give you a lot of nice features to help you write code, but how many of these features can we get rid of and still be capable of doing everything we could before?

Subscribe :)
Рекомендации по теме
Комментарии
Автор

you can also do this with nand gates, wich is the gate that is more famous for having this property

joaocabralpv
Автор

1:20 as someone who’s trying to figure out how to make a node based UI with custom defined signal flow I appreciate this train of thought

sanjaux
Автор

i can see the fireship inspiration style but you have your unique touch which overpowers his keep going its good shit mijo!

rauchu
Автор

My favorite simple computation system is the SK combinator calculus. It's so cool that you can create any program with just two functions.

paulzupan
Автор

This video is basically reverse engineering the theory of computation lol, good to see an upload from this channel!

markzuckerbread
Автор

I wonder, would the lambda calculus also count as a "simple language"? All you need is abstraction, variables, and application.

zyansheep
Автор

Complexity grows in direct proportion with the amount of options presented.

onrir
Автор

Congratulations, you have discovered the integrated circuit.
Although there it is typically the NAND gate.

leonhard.doerflinger
Автор

I know I'm coming in late, but another nice minimal system is bitwise cyclic tag (BCT). Definitely worth checking out

Quasarbooster
Автор

Never met a Chanel this concise while remaining interesting and informational, btw I like your color schemes.

jungwisely
Автор

3:30 not quite, you can go one step further and reduce all those to individual transistors in different configurations, now all we are left with is boolean and mosfets :D

huangjunwei
Автор

Welcome back Byte of Code! I wonder if anyone has made an esolang that's like this...

Truttle
Автор

I created a very simple Turing complete laungage once:
Start with two variables that store a natural number: A and B. There are four instructions:
1. Do nothing.
2. Increase both variables by 1.
3. If A is greater than 0, decrease it by 1 and skip next K instructions.
4. Same as above, but for B.
I dont know yet what is the minimum value for K so let's say that K=100 (this means that you skip 100 instructions). The program loops around: if you go to the end then you loop back to the beggining. There is one extra Halt instruction on the and of the program. If you encode input correctly into A and B than this system is Turing complete.

M_
Автор

This video is the closest thing to playing many many hours of the game turing complete ive ever seen btw

klembokable
Автор

this guy is pretty good, he should try making functional programming videos

wackyator
Автор

I've never heard of the 10 other logic gates, does anyone have a link to somewhere where I could read about them?

rue
Автор

Are you familiar with Minecraft Redstone? Because this is basically how you needed to get _anything_ done in that environment. There is no programming language (unless you count Command Blocks), there are no packaged logical gates. All we had was NOR in the form of the Redstone Torch, and everything was built from that. We didn't even have NAND like most computation environments, at least not without building one from 2 NOR gates (and an implicit OR from just combining the wires; a trick that doesn't actually work in real electronics).

angeldude
Автор

I really appreciate this vsauce reference

ivanorex
Автор

Pffft... NOR gates? When the Chad NAND is standing right there?

(excellent video)

DanielAfonso-IT_Consultant
Автор

I mean Isn't a turing machine the most basic model of computation and every other model can be expressed as it? So essentially you can encode the nor gate into a turing machine and otherwise just use true and false on the cells I think. This also tickles my very novice category theory sensors. A category of turing machines.

Rockyzach