What does Touring Complete mean?

Can someone explain to me what this is, in simple terms? Wikipedia can't explain shit

TURING COMPLETE MEANS THAT IT CAN DO ANYTHING. basically.

well, not do, COMPUTE.

for example if I have a computer and there are only two commands, add and subtract. It's not turing complete - It can do jack.

or can't do jack. I'm not sure if jack is something or nothing - can anyone confirm?

>>1
Then there's the concept of Touring-completeness. Both C and C++ are Turing-complete, but only C++ is Touring-complete; it was designed as an extension to fix this issue of C of not being Touring-complete.

>>4
If it can subtract AND jump, then it's Turing-complete. See SBN.

>>5
Jack can be something or nothing, depending on context. The real question is, is Jack Touring Complete?

>>2
Okay, so if something is touring complete, that it means it can be used to do any computation? Then what was that `ducks are touring complete' meme about? How can a fuck bbe touring complete?

BBCode is touring-complete

>>7
Jack Sparrow can move over an infinite ocean, on every turn he can either:
1) Flip out and kill people.
2) Move his pirate ship to a place where he can flip out and kill people.

My conclusion is that Jack Sparrow is indeed Touring-complete.

Jack Sparrow can move over an infinite ocean, and on every turn he can either:
- Flirt with his friend's merchandise
- Flip over his ship to switch ocean

I am Jack's touring complete meme.

XHTML is touring-complete

>>13
A touring-complete extension to HTML, to be specific.

>>8
You can't compute love.

>>15
I demand a proof that love is incomputable.

>>16
I demand a proof that love is computable.

>>15
Holy Flying Jesus of Tijuana, this made me laugh!

You best be trollin' nigga.

    HTML doesn't have classes. If you understood the divine structure of HTML, you would know there is no need for classes.

    You know, when I was younger I also used to wonder why there was no support for object-oriented programming in HTML. Back then, it seemed to me like OOP was the new cool thing that should be incorporated in every real programming language.

    But then one night in 2004, as I was writing my third HTML operating system, I had a great revelation. I saw the Document Object Model unfold in front of me. I saw the beautiful patterns of tags and attributes – the structure. As I witnessed perfection in its purest form, I realized how foolish and naïve I had been, having thought HTML would have any need to implement such a primitive paradigm as object-oriented programming.

    You might ask "so how do I accomplish [foo] in HTML then?", and the simple truth is that if you're thinking about the problem in object-oriented terms, your approach is the wrong one to begin with.

    The marvelous structure of HTML transcends time, space and reality. It is not something you can simply explain with words, you have to be able to feel the very spirit of hypertext within you. I hope one day you will be able to experience what I did.

>>1

Being touring-complete can be a tremendous task nowadays. It depends on how high you wish to aim, but generally, your band needs to have gotten not only a record label, but also international fame, before you can go on a tour of a decent size.

Thus, being 'touring-complete' is a bit ambiguous at best. You could 'tour' at your high-school, or you could be a part of Wacken.

I hope this answers your question sufficiently, though I must admit that I'm not an expert on this field. For instance, I'm not sure if being a contestant in Tour de France would make you touring-complete..? (It would be rather nice if someone could clarify, actually)

Humans are touring-complete... Now time for a poem..

It is by caffeine alone I set my mind in motion,
It is by the beans of Java that thoughts acquire speed,
The hands acquire shaking, the shaking becomes a warning,
It is by caffeine alone I set my mind in motion.

Subtract and branch if negative bitches

ZZT-OOP

>>20
HOLY SHIT I WROTE THIS MONTHS AGO

Turing Completeness means that it can do anything a Turning machine can do, that is, pretty much any calculation. The simplest test I've found is: if you can write an interpretter for Brainfuck in it, its Turing-complete. Actually, no current computer is Turing-complete, because no current computer has an infinite amount of memory to work with.

nigger

check 'em

>>12
I am jack's raging envy of touring complete pirate ships

>>7
Nice ID, bro.

>>33
Nice dubs, bro.

thanks

                        ██████████████████████                                                                           
      ██████████████████                      ████            ██████████████    ████    ██    ██  ██████    ████    ██    ██
    ██                      ██                    ████  ████████████████████  ██    ██  ██    ██  ██      ██    ██  ██  ██
    ██                  ████            ██            ████    ██████████████  ██        ████████  ████    ██        ████ 
      ██████████████████          ██████                ██    ██████████████  ██    ██  ██    ██  ██      ██    ██  ██  ██
                    ██        ████    ██                ██    ██████████████    ████    ██    ██  ██████    ████    ██    ██
                    ██████████        ██                ██    ██████████████                                             
                      ██          ████  ██              ██    ██████████████  ██████████  ██    ██  ██████  ██      ██   
                        ██████████      ██              ██    ██████████████      ██      ██    ██  ██      ████  ████   
                          ██        ████  ██            ██    ██████████████      ██      ████████  ████    ██  ██  ██   
                            ████████      ██            ██    ██████████████      ██      ██    ██  ██      ██      ██   
                            ██        ████              ██    ██████████████      ██      ██    ██  ██████  ██      ██   
                              ████████            ████████    ██████████████                                             
                                      ████████████      ████████████████████                                             
                                                              ██████████████

>>34
le_sneaky_codfish_face.bmp