<p>The goal: Any language. The smallest function which will return whether a string is a palindrome. Here is mine in <b>Python</b>:</p>

<pre><code>R=lambda s:all(a==b for a,b in zip(s,reversed(s)))
</code></pre>

<p>50 characters.</p>

<p>The accepted answer will be the current smallest one - this will change as smaller ones are found. Please specify the language your code is in.</p>

Here's mine; it's written in a domain-specific language I invented, called 'palindrome'.
```
```
p
```
```
Edit:
Less flippant version (i386 asm, AT&T syntax)
```
```
xor %eax, %eax
mov %esi, %edi
#cld    not necessary, assume DF=0 as per x86 ABI
repne scasb
scan:
    dec %edi
    cmpsb
    .byte 0x75, 6    #jnz (short) done
    dec %edi
    cmp %esi, %edi
    .byte 0x72, -9    #jb (short) scan
inc %eax
done:
```
```
16 bytes, string pointer goes in ESI, result is in EAX.