Questions tagged [computability]
83 questions
0
votes
1 answer
Can a Turing machine decide if a formal model of computation is Turing complete?
That is, can a Turing machine take a formal system, S, as its input and decide if S is Turing complete?
I think this is an undecidable problem, am I right?
If it is undecidable, why can we (as humans) decide Turing completeness?
Jack McKay Fletcher
- 129
- 8
0
votes
1 answer
jquery not working well on IE8
I have built a page which loads data dynamiically from a DB and uses jQuery to add html labels and classes to the page
the html is