Hi
Charlie-Boo wrote:
Please let me know if anyone is truly interested in any of the above.
Not with pre-defined propositional calculus axioms hard-wired for each
theorem. Rather, an authentic formalization of any branch of Computer
Science. Really. Please do.
Seems that you are confusing computer science and
theoretical computer science.
If you don't have any "pre-defined" axioms, you don't
have a specification of a problem, and you cannot
derive a program resp. solution. At least not in a goal
directed fashion. (*)
If you do not work with any "pre-defined" axioms, you
maybe get a bunch of theoretical results, like
every image of a primitive recursive function is
bla bla.
Maybe a middle ground would be to have families of
problems axiomatized. This is often found in descriptive
complexity theory. In my opinion a branch between
computer science and theoretical computer science.
Bye
|