flWhy Turing's machine are the universal basis for computers while the mathematicians have described several alternate models of effective computability : lambda calculus, general recursive functions, etc. Does it mean that in a certain way Turing's machines are more fundamental ? (While we know that they are just as potent as the other models.)
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.