In 1997 or so, I wrote a small game in html (no javascript) that used the timed refresh meta. It showed a screen with images, good and bad guys, where you had to “shoot” the bad guy first. If you waited to long, you were shot. If you shot a good guy, you would loose as well. Not much for a game, but I was happy it could all be done with plain HTML 🙂
This is a fantastic discovery. Completely novel to me, but I am concerned about browser compatibility. It looks like CSS3 so you can count out most IEs. What have you found?
JeffEsays:
It’s not Turing-complete? Really? Seems like you could have all sort of fun with counters and ‘move-to’.
Iansays:
My instinct is that it is not, because you can’t delete characters on the ‘tape’. Counters and generators provide some limited computation ability but it’s not arbitrary and requires significant setup in the HTML to do anything big. Proving Turing-completeness is done by reducing a known Turing-complete language to the target… I haven’t seen that done.
Kevembuanggasays:
Sheesh…
A Turing Tar Pit which isn’t even Turing complete!
In 1997 or so, I wrote a small game in html (no javascript) that used the timed refresh meta. It showed a screen with images, good and bad guys, where you had to “shoot” the bad guy first. If you waited to long, you were shot. If you shot a good guy, you would loose as well. Not much for a game, but I was happy it could all be done with plain HTML 🙂
@mattcopp
I’d like to know myself whether it works under Internet Explorer.
@JeffE Good old CSS is certainly not Turing complete. Is CSS3 Turing complete? I would be surprised, but please, suprise me!
References:
Wieser, C., CSS NG: An Extension of the Cascading Styles Sheets Language (CSS) with Dynamic Document Rendering Features, 2006.
Kepser, S., A simple proof for the Turing-completeness of XSLT and XQuery, Extreme Markup Languages, 2004
This is a fantastic discovery. Completely novel to me, but I am concerned about browser compatibility. It looks like CSS3 so you can count out most IEs. What have you found?
It’s not Turing-complete? Really? Seems like you could have all sort of fun with counters and ‘move-to’.
My instinct is that it is not, because you can’t delete characters on the ‘tape’. Counters and generators provide some limited computation ability but it’s not arbitrary and requires significant setup in the HTML to do anything big. Proving Turing-completeness is done by reducing a known Turing-complete language to the target… I haven’t seen that done.
Sheesh…
A Turing Tar Pit which isn’t even Turing complete!
@Kevembuangga People do useful things with CSS all the time, so it does not qualify as a bona fide Turing tar pit.
it does not qualify as a bona fide Turing tar pit.
I CAN tell you it does! 😀
CSS3 just has proven to be Turing-Complete. You only need a veeeeery large HTML document.