Learn More
Resend Email
7
happygimp0
1y

([]+{})[+!![]+[+[]]]+(![]+[])[!+[]+!![]+!![]]+(+{}+{})[+!![]+[+[]]]+(![]+[]+[][[]])[+!![]+[+[]]]+(![]+[])[!+[]+!![]+!![]]+(+{}+{})[+!![]+[+[]]]+([]+{})[+!![]+[+!![]]]+(![]+[])[+!![]]+(![]+[])[!+[]+!![]+!![]]+(+{}+[]+ +!![]/+![])[+!![]+[+[]]]+(+{}+{})[+!![]+[+[]]]+(!![]+[])[+[]]+([]+{})[+!![]]+(+{}+{})[+!![]+[+[]]]+(!![]+[])[+!![]]+([]+{})[+!![]+[+!![]]]+(![]+[])[+!![]]+([][[]]+[])[!+[]+!![]]+(+{}+{})[+!![]+[+[]]]+(![]+[])[+!![]]+([][[]]+[])[+!![]]+([][[]]+[])[!+[]+!![]]+(+{}+{})[+!![]+[+[]]]+([][[]]+[])[+[]]+([][[]]+[])[+!![]]+([][[]]+[])[!+[]+!![]]+([]+{})[+!![]+[+!![]]]+(!![]+[])[+!![]]+(![]+[])[!+[]+!![]+!![]]+(!![]+[])[+[]]+(![]+[])[+!![]]+([][[]]+[])[+!![]]+([][[]]+[])[!+[]+!![]]

joke/meme

readable

obvious

javascript
Favorite
Ranter
Comments
  • 3
    1y
    NaN
  • 1
    1y
    For anyone who doesn't understand this: JavaScript has a very obvious way to interpret this and generate a string: See here https://github.com/denysdovhan/...

    To generate such strings see here:

    https://bluewings.github.io/en/...
  • 2
    1y
    @kobenz brainfuck ftw
  • 2
    1y
    @kobenz Brainfuck makes at least sense for what is trying to do. JavaScript is supposed to be a practical language.
  • 3
    1y
    @happygimp0 JS is more of a brainfuck than brainfuck itself.
  • 0
    1y
    I thought this was super cool when I first read an explanation of this haha
  • 0
    1y
    Wtf is this ?
  • 0
    1y
    Syntax error: missing `closing parenthesis`
  • 0
    1y
    lol, It says: "js is easy to read and understand"
  • 1
    1y
    How are you not gonna link https://jsfuck.com? It uses even fewer characters
  • 0
    1y
    @localpost I didn't know about it.
  • 0
    1y
    @kobenz >>>+[[-]>>[-]++>+>+++++++[<++++>>++<-]++>>+>+>+++++[>++>++++++<<-]+>>>,<++[[>[ ->>]<[>>]<<-]<[<]<+>>[>]>[<+>-[[<+>-]>]<[[[-]<]++<-[<+++++++++>[<->-]>>]>>]]<< ]<]<[[<]>[[>]>>[>>]+[<<]<[<]<+>>-]>[>]+[->>]<<<<[[<<]<[<]+<<[+>+<<-[>-->+<<-[> +<[>>+<<-]]]>[<+>-]<]++>>-->[>]>>[>>]]<<[>>+<[[<]<]>[[<<]<[<]+[-<+>>-[<<+>++>- [<->[<<+>>-]]]<[>+<-]>]>[>]>]>[>>]>>]<<[>>+>>+>>]<<[->>>>>>>>]<<[>.>>>>>>>]<<[ >->>>>>]<<[>,>>>]<<[>+>]<<[+<<]<]
  • 0
    1y
    @kobenz pretty sure that exists lol

    https://enkhee-osiris.github.io/Dec...
  • 0
    1y
    @kobenz Sorry, i don't understand that. Can you rephrase it with a different sentence?
  • 0
    1y
    @kobenz I am too stupid to understand that.

    Assuming it is brainfuck: There is no input. But the output depends on cell size, with a 8 bit cell the output is "Wiqqe" followed by some binary data i don't understand.

    00000000: 5769 7171 6587 b1a8 8ca9 adb4 abb7 b5ac Wiqqe...........

    00000010: b9b0 6b11 180f 0409 02fb f6ef e4eb e2cd ..k.............

    00000020: fb02 fdf6 ....

    Or: V2lxcWWHsaiMqa20q7e1rLmwaxEYDwQJAvv27+Tr4s37Av32

    ??? What does that mean?
  • 1
    1y
    @kobenz You know that >>>+[[-]>>[-]++>+>+++++++[<++++>>++<-]++>>+>+>+++++[>++>++++++<<-]+>>>,<++[[>[ ->>]<[>>]<<-]<[<]<+>>[>]>[<+>-[[<+>-]>]<[[[-]<]++<-[<+++++++++>[<->-]>>]>>]]<< ]<]<[[<]>[[>]>>[>>]+[<<]<[<]<+>>-]>[>]+[->>]<<<<[[<<]<[<]+<<[+>+<<-[>-->+<<-[> +<[>>+<<-]]]>[<+>-]<]++>>-->[>]>>[>>]]<<[>>+<[[<]<]>[[<<]<[<]+[-<+>>-[<<+>++>- [<->[<<+>>-]]]<[>+<-]>]>[>]>]>[>>]>>]<<[>>+>>+>>]<<[->>>>>>>>]<<[>.>>>>>>>]<<[ >->>>>>]<<[>,>>>]<<[>+>]<<[+<<]<] is a interpreter for brainfuck? (not written by me).
  • 1
    1y
    @happygimp0 challange: write a program in brainfuck which takes another brainfuck program as input and then outputs "yes" if that input program eventually halts and otherwise "no".
  • 0
    1y
    @Lensflare For that it either has only a limited number of cells with a limited maximum, a limited number of steps or i would have to solve every mathematical problem (and there are an infinite amount of them).

    Limited means: If it wants to access more cells, it has to wrap around (same with the value of a cell which can't be infinite). Or after N steps it is considered that it doesn't halt, even if it would after N+M steps.
  • 1
    1y
    @happygimp0 how hard can it be to solve the halting problem?
  • 0
    1y
    @Lensflare I have a much easier challenge for you: Write a program that outputs the busy beaver numbers from 0 to 100. Couldn't be that hard?

    I mean, just start with:

    BB0: 0

    BB1: 1

    BB2: 4

    BB3: 6

    BB4: 13

    And then continue till BB100
  • 0
    1y
    @happygimp0 should be easy enough. I’ll let you know when it’s done.
Related Rants
devRant © 2021 Hexical Labs LLC
Privacy Policy  |  Terms of Service
Add Comment