Then I can, but that doesn't help me.
See http://en.wikipedia.org/wiki/Axiom_of_regularity
It states:
Every non-empty set A contains an element B which is disjoint from A.
I appreciate all of your help.
This is a separate question. I absolutely want to be in such territory. I need to show that the aforementioned set inclusions yield C ε C and then I can invoke the axiom of regularity/foundation to show it is a contradiction.
I agree. I am now asking modified question: How then can I show that if A ε B and B ε C and C ε A, that C ε C (yields the contradiction I require).
Apologies for the confusion.
I was just playing around with sed regular expressions and found something I wouldn't have expected.
What is the difference between /\.[^.]*$/ and /(\.[^.]*)$/?
Does the latter group it incorrectly somehow.
Note that the former does what I want it to, to match an extension of a file...
That makes perfect sense. Thanks!
I should only be writing 7 spaces... I am writing one at the end it seems. I'll add a condition to my space-writing if statement.
I am now passing by reference. It looks to me more like overflow than an access violation...
The code:
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <locale.h>
#define TRUE 1
/*
* Converts from little to big endian or vice-versa
* Labeling bytes from 0...