Turing machines on represented sets, a model of computation for Analysis
We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM can store a symbol, a real number, a continuous real function or a probability measure, for example. The model is based...
সংরক্ষণ করুন:
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
Logical Methods in Computer Science e.V.
2011-06-01
|
| মালা: | Logical Methods in Computer Science |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://lmcs.episciences.org/1122/pdf |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|