Re: controversial paper
From: Mxsmanic (mxsmanic_at_hotmail.com)
Date: 09/30/03
- Next message: David Wagner: "Re: Paper - impossible to prove P=?NP"
- Previous message: Bryan Olson: "Re: Paper - impossible to prove P=?NP"
- In reply to: Mok-Kong Shen: "Re: controversial paper"
- Next in thread: Mok-Kong Shen: "Re: controversial paper"
- Reply: Mok-Kong Shen: "Re: controversial paper"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Tue, 30 Sep 2003 02:12:59 +0200
Mok-Kong Shen writes:
> To be able to process a variable field, you would need
> indicators and that also consumes space (bits).
Yes, but if there is no constraint on the length of the variable field,
this is not a problem.
You actually don't even need an addressing scheme that is open-ended at
both ends. Just allowing for unlimited high-order bits will do. That
way, if you run out of allocations in 128 bits, you just add more bits
at the high end. Like patent numbers.
> If I don't err, in data bases records for efficient processing
> are in fixed format, eventually with links to variable length
> informations as needed.
A fixed record that links to a variable-length record is effectively a
variable-length record.
-- Transpose hotmail and mxsmanic in my e-mail address to reach me directly.
- Next message: David Wagner: "Re: Paper - impossible to prove P=?NP"
- Previous message: Bryan Olson: "Re: Paper - impossible to prove P=?NP"
- In reply to: Mok-Kong Shen: "Re: controversial paper"
- Next in thread: Mok-Kong Shen: "Re: controversial paper"
- Reply: Mok-Kong Shen: "Re: controversial paper"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|