Compactification of information in r-color 2-dimensional rectangular patterns
作者：
Highlights：
•
摘要
A method for uniquely condensing r-color, 2-dimensional rectangular pattern information into a single real number is illustrated. It is seen that this method allows one to reconstruct the original pattern with no problems about the uniqueness of the reconstruction, if one is given the symbol assignment table.
论文关键词：r-color,2-dimensional patterns,Gödel numbers,Proof theory,logic,Gödel patterns,Holographic memory
论文评审过程：Received 14 June 1978, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(78)90003-1
