hey Jow Forums
anyone knowledgeable of turing machines?
Im reading the paper he made on them and he talks about skeleton tables. I don't understand jack shit, can't find jack shit online either. Anyone here who isnt a complete compsci poser who can enlighten me?
thanks!
cade
fucking POSERS
A turing machine is just a deterministic finite state machine with an infinite tape attached to it and a transition function that takes the current state and tape symbol and returns a new state, symbol to write, and direction to move head in.
I suggest you look into finite state machines first if you haven't already.
t. actual compsci student.
i did, i understand their functionality and states, just not the skeleton table shit turing pulled out of his ass.
I know exactly how turing machines work but won't help you because you just don't insult the people you are trying to get information from.
I've never heard of skeleton tables before. Sorry can't help.
lmao thin skinned faggot
i know how they work too.
and if you're not a poser, then it doesn't even apply to you but the people at the desktop threads.
no prob. thanks; here's the definition from the actual paper if it helps.
Here's the answer:
>One interesting convention Turing establishes is only writing solutions on alternative squares called F-squares and the other squares, called E-squares, are used as a sort of scratch pad. We didn’t use this convention, but it can help you write shorter algorithms.
>The introduction of m-functions (machines expressed as functions) is more important since it means you can define a computing machine in terms of other computing machines. He called these “skeleton tables” because they were the basis for writing more advanced machines.
>swizec.com
Don't bother finishing the paper. That you're incapable of performing literally fifteen seconds of cursory research pretty much guarantees you to a life of mediocrity.
Yeah, that's what they are. Not exactly how to implement them, which is what im looking for.
Thanks anyway.
Start with the inner most part and work your way up to the big boy stuff.
i have for the most part, i know how to make AF's and DFAs already.
>cs.stackexchange.com
another reminder to quit now
already been there
doesn't show how to make them.
just says hurrdurr it's like macros! i need the syntax.
here's the syntax
(kill (your (self)))
thanks, just what i needed
try looking up macros you fucking idiot
#if !GOTTEN_IT_YET
kill_self(true);
#endif
>implying there's IFs in m-configurations
can you stop replying?
you're obviously clueless.
that's not a m-function that's a preprocessing directive. It's also a hint. I'm not spoonfeeding you the answer you goddamn brainlet.
that's because you don't know it.
thanks for bumping!
>what is a sage
you'll never make it.
And your bait is weak. You'll get nothing more from me, but I'll stick around the thread to watch you flounder and struggle.
ok
thanks for your time then user!
try reddit you stooge
turns out there is no real syntax
thanks for nothing, user
no shit
>BLEHEHEH KILL URSELF FAG
>NO U
>NO UR GAY
>NEVER GONNA MAKE IT
>LE REDDIT
>IMPLYING UR SMART
>IMPLYING SMARTER THAN ME LMAO
>CS posers
you're the fucking moron who wasted god knows how long looking for an 'official' syntax for an abstract computational construct from a century ago. You were given a well-known example implementation as also given in the stack overflow post, namely the macro expansions as defined in the C pre-processor, and you have nothing then shitty cat pics and decade-old insults habitually double-spaced apart. This scenario will play out again and again in your life. Your progress will be too slow for you to accomplish anything meaningful. KYS.
lmao stay assmad nerd