Re: DEF -- Given "the empty set"
- From: Julio Di Egidio <julio@xxxxxxxxxxxxx>
- Date: Mon, 19 May 2008 05:00:53 EDT
Conjectural definitions: Formal Complexity
DEFINITION: Formal Kernel
A formal kernel in a system is (to be) encoded in a deterministic computer language.
DEFINITION: Formal Complexity
The complexity of a formal system is (in) the count of its primitive symbols.
-LV
.
- Follow-Ups:
- Re: DEF -- Given "the empty set"
- From: julio
- Re: DEF -- Given "the empty set"
- References:
- Re: DEF -- Given "the empty set"
- From: Julio Di Egidio
- Re: DEF -- Given "the empty set"
- Prev by Date: Re: Is it true that exp(pi*i) = -1?
- Next by Date: Re: Comprehensive Solution Manual for Textbooks
- Previous by thread: Re: DEF -- Given "the empty set"
- Next by thread: Re: DEF -- Given "the empty set"
- Index(es):