3 ms·
Hardly 'competing', more like (say) Commodore-64 demo Vs nVidia GPU demo scenes - you pick your arena and push what can be done with constraints (axioms). In m
by defrost 3y ago
Hardly 'competing', more like (say) Commodore-64 demo Vs nVidia GPU demo scenes - you pick your arena and push what can be done with constraints (axioms).
In mathematics you might compare groups that work with Vs without the Axiom of Choice, you can can have one group satisfied by an existence proof that asserts X exists otherwise a contradiction must exist and another group that only accept existence proofs that demonstrate a means to construct an example of X.
The habeas corpus divide :-)
- FieryTransition 3y agoBut is a Hilbert system easier to run in a computer since there are many axioms which clarifies the cases where contradictions or some inference rules are used which might be hard to program? For example, on the top of my head, in predicate logic, how would you encode an inference rule like exists elimination? It's tricky enough for me to think about, but to be able to encode a computer with it, is harder, and I can't remember if something like this falls under the undecidable problems category or not.