lambda calculus

Symbol strings can represent numbers and functions. Using functions on input function and data strings makes output function and data strings {lambda calculus}. Systems expressing lambda calculus make many new strings. Removing random, irregular, or long strings can keep number of strings constant, and system can evolve toward stable set of strings. One string can copy itself better than others and become more numerous than other strings {level-0 organization}. Removing strings that copy themselves causes one or more repeating string cycles {level-1 organization}.

Related Topics in Table of Contents

Mathematical Sciences>Computer Science>Systems

Whole Section in One File

3-Computer Science-Systems

Drawings

Drawings

Contents and Indexes of Topics, Names, and Works

Outline of Knowledge Database Home Page

Contents

Glossary

Topic Index

Name Index

Works Index

Searching

Search Form

Database Information, Disclaimer, Privacy Statement, and Rights

Description of Outline of Knowledge Database

Notation

Disclaimer

Copyright Not Claimed

Privacy Statement

References and Bibliography

Consciousness Bibliography

Technical Information

Date Modified: 2022.0224