thus spoke Death in 'blogs' :: Something smarter than us is going to emerge


node:	thus spoke Death in 'blogs'
template:	4
parent:	blogs
owner:	BlackDeath
viewed by:
created:	19.08.2004 - 12:59:26

cwbe coordinatez:
101
63535
21
1066985

ABSOLUT
KYBERIA

permissions
you:	r,
system:	public
net:	yes

I have a Turing mashine.
YAY!

0000010100063535000000210106698501067742

Brainfuck is a minimalist computer programming language created by Urban Müller around 1993. The language is sometimes referred to as brainf*ck, brainf***, or just BF in polite company.

Müller's goal was to create a simple Turing complete programming language which could be implemented with the smallest possible compiler. The language consists of eight statements. Version 2 of the original compiler (http://wuarchive.wustl.edu/pub/aminet/dev/lang/brainfuck-2.lha), written for the Amiga, was 240 bytes in size.

As the name suggests, brainfuck programs tend to be difficult to comprehend, perhaps so much so as to drive the programmer insane. However, the Turing machine, and therefore brainfuck, can accomplish any computing task. Disregarding the apparent difficulty in programming certain tasks in brainfuck, it is certainly possible to do so.

The language is based on a simple machine model consisting, besides the program, of an array of bytes initialized to zero, a pointer into the array (initialized to point to the first byte of the array), and two streams of bytes for input and output.

000001010006353500000021010669850106774201067754

A Brainfuck program has an implicit byte pointer, called "the pointer", which is free to move around within an array of 30000 bytes, initially all set to zero. The pointer itself is initialized to point to the beginning of this array.

The Brainfuck programming language consists of eight commands, each of which is represented as a single character.

> Increment the pointer.
< Decrement the pointer.
+ Increment the byte at the pointer.
- Decrement the byte at the pointer.
. Output the byte at the pointer.
, Input a byte and store it in the byte at the pointer.
[ Jump forward past the matching ] if the byte at the pointer is zero.
] Jump backward to the matching [ unless the byte at the pointer is zero.

The semantics of the Brainfuck commands can also be succinctly expressed in terms of C, as follows (assuming that p has been previously defined as a char*):

> becomes ++p;
< becomes --p;
+ becomes ++*p;
- becomes --*p;
. becomes putchar(*p);
, becomes *p = getchar();
[ becomes while (*p) {
] becomes }

00000101000635350000002101066985010677420106775401068297

Ook! is a programming language designed for orang-utans. Ook! is essentially isomorphic to the well-known esoteric language BrainF***, but has even fewer syntax elements.

Design Principles

A programming language should be writable and readable by orang-utans.
To this end, the syntax should be simple, easy to remember, and not mention the word "monkey".
Bananas are good.

http://www.dangermouse.net/esoteric/ook.html

----

a este jeden:

http://cgibin.erols.com/ziring/cgi-bin/cep/cep.pl?_key=Befunge

00000101000635350000002101066985010677420106775401067829

wole,, to sa zmesti do mobilu,, co do mobilu,, do
digitalnych hodiniek,,, :)))

00000101000635350000002101066985010677420106775401067828

WOW,,.., WOW,, to je dobreeeee, fuckt :)
I feel like brainfukd,,
to som zvedavy,, kolko by mali zdrojaky kernelu v tomto jazyku :>

0000010100063535000000210106698501067721

Who wants to play?
Prave som dopisal priklad, ktory reversuje slovo,, mnaaaam,,
blbe je, ze na zapocet to MUSI byt pod DOS :(((((((((

0000010100063535000000210106698501067400

deterministicky alebo nedeterministicky?
;)

000001010006353500000021010669850106740001067585

"iba" deterministicky :)
ved ono je to jedno :))) nie su nahodou ekvivalentne?
(aspon si to tak pametam s prednasky)

00000101000635350000002101066985010674000106758501067589

myslim ze to je otvoreny problem ale vseobecne sa predpoklada ze su rovnake.

0000010100063535000000210106698501067400010675850106758901067602

0000002101066985010674000106758501067589
deterministicky ci nedeterministicky?

000001010006353500000021010669850106740001067585010675890106760201067716

a to je co? :)

0000010100063535000000210106698501067079

woe .. co je turing mashine?

000001010006353500000021010669850106707901067576

poslem ti slide z prednasky, daj adresu :)
a keby si velmo chcel tak aj zdrojak v assembleri :)
(az bude hotova dokumentace)

0000010100063535000000210106698501066988

heh worst boys have the best toys

000001010006353500000021010669850106698801067071

jeeeej, to je pekneeee :)

btw, what about counting to infinity?
you can count god in infite time, can't you?

00000101000635350000002101066985010669880106707101067427

count god :) lol
so u r feeling countable ?

0000010100063535000000210106698501066988010670710106742701067590

well, :DDD
Myself is "just" another Turing mashine anyway :)