|
|
 |
|
|
| The Guild - Episode 3: The Macro Problem |
 |
The Guild Season 1 DVD NOW ON SALE!
http://www.watchtheguild.com/gear/dvd/
Exclusive Gag Reels
Cast/Director Commentary
English Subtitles and MORE!
Codex's problem with Zaboo gets sidetracked
by a crisis in The Guild.
1) Subscribe to our Channel! Our new video
will show up on your YouTube Homepage!
2) Friend us at MySpace!
www.myspace.com/watchtheguild
3) Join our Facebook Fan page!
http://www.facebook.com/pages/The-Guild/60682
32341
4) go to www.watchtheguild.com and click on
our RSS button in the top right corner! When
we post a new video, it will show up in your
RSS feeder, whatever it is that you use
(iGoogle homepage, Google Reader, etc.) You
can also add our RSS feed to any social
network you're a part of!
Created and starring Felicia Day - Buffy's
(Vi), Directed by Jane Selle Morgan -
seejanedirect.com and Produced by Felicia
Day, Kim Evey - creator of Gorgeous Tiny
Chicken Machine Show and Jane Selle Morgan
English Subtitles: Daniela Figueiredo
Dutch Subtitles: Sebastiaan van Dijk
Portuguese Subtitles: Daniela Figueiredo,
Rodolfo Cid and SomeLazyDr
Guild Felicia Day gamer video game console
warcraft dungeon everquest heros avatar
series webisode buffy
Tags : comedy web series webisode funny sitcom gamers video game Warcraft entertainment guild buffy |
|
Affichage : 842505
Durée : 268 s |
| Depeche Mode: Macro |
 |
Depeche Mode: Macro
From: Playing The Angel
Lyrics:
Overflowing senses
Heightened awareness
I hear my blood flow
I feel its caress
Whispering cosmos
Talking right to me
Unlimited endless
God breathing through me
See the microcosm
In macro vision
Our bodies moving
With pure precision
One universal celebration
One evolution
One creation
Thundering rhythm
Pounding within me
Driving me onwards
Forcing me to see
Clear and enlightening
Right there before me
Brilliantly shining
Intricate beauty
Macro - Martin L. Gore
Grabbing Hands Music. 2005.
www.fulekipictures.extra.hu
Tags : depeche mode macro playing the angel pictures rhythm pop electronic microcosm vision space universum martin gore |
|
Affichage : 14090
Durée : 192 s |
| macro processor |
 |
Sorry. I left my headset plugged in, so the
audio on the camera did not work.
However I don't want to remove this post
because I got an encouraging comment from a
viewer.
--------------------
I take a "devil's advocate" position, and
assume that there is no difference between
macro processing and language processing - in
the sense that macro processors and language
processors are universal Turing machines, and
can be provided with arbitrarily easy to use
user interfaces.
This term has been used at least since 1965,
when Strachey published details of his GP/M
macroprocessor in Computer Journal.
A simple example of its use would be to
convert the Cobol statement "ADD A TO B" to
the Fortran statement "B = B + A".
Is there any difference between a "macro
processor" and a "language interpreter"? Just
as any computer language has general
computational power, so does any macro
language (or at least we can add commands to
it if necessary, until this point is
reached).
It is said that the C preprocessor has the
power of a universal Turing machine. But this
will be of little value to people unless it
provides an easy to use interface. A device
can be a universal Turing machine without
providing an attractive user interface,
because it may be too expensive (in today's
computer costs) to provide an attractive user
interface. Some Turing machines would take
the age of the universe to carry out a simple
computation - presumably we might get a
result like this if we tried to build a user
interface using (only) the C preprocessor.
The Forth language was originally implemented
in Fortran. It allows the user to add
commands to the language interactively.
The Unix command line encourages people to
write little programs, and then use them to
build other programs, using facilities such
as piping.
What kinds of languages can we invent? How
much can we do with simple languages based on
English?
Forth and Lisp both look to be a long way
from standard English.
Is it possible, at last, to use standard
English as a computer programming language?
Given an English sentence, we can break this
up into "kernel sentences".
Someone in the 1960's suggested using natural
language as a specification, and converting
this to an implementation in 5 steps.
Presumably, we can use natural language for
specifying all the intermediate steps. For
the final step, we can write "kernel
sentences" which we already know will be
understood by the system. So it seems that
natural language can be used at every step,
as the only language we need to use - given
that we have worked out already how to
convert "kernel sentences" to a computer
implementation.
Unix achieved its fame from allowing the user
to specify multiple tasks. This was promoted,
around the same time, by Brinch Hansen with
Concurrent Pascal. Languages such as PL/I,
and Burroughs languages, already provided
this feature.
Has anyone written a macro processor which
provides a "multi tasking" feature? We could
implement template matching by using
multi-tasking, with "daemons" for each
template watching for their occurrence, as in
a blackboard system.
But is this the full story? Is there a way
that we want the macroprocessor to be able to
run other tasks. For example, by running
other tasks, we can build a machine running
exponential numbers of tasks.
Last year I heard of Peter Wegner's work in
the late 1990's, when he said there was a new
computing paradigm of interaction rather than
computation. I did not agree with him - the
machinery for interaction has been well known
since Dikstra, "Cooperating Sequential
Processes", 1965 - Simula was also invented
in the 1960's. However, I now concede that
progress has been slow in writing software
this way. Certainly Unix is a very good
example, as is the Unisys A series computer.
If anything Wegner says encourages people to
write software as interacting agents, then I
applaud wholeheartedly.
Tags : macro processor |
|
Affichage : 786
Durée : 342 s |
|
|
|
|
|
|
|
|
|
|
 |
| |
|
