{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:38Z","timestamp":1725488618289},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_45","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"412-415","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Real - Time Turing Machine"],"prefix":"10.1007","author":[{"given":"Oksana","family":"Scegulnaja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"issue":"6\/7","key":"45_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R. Feynman","year":"1982","unstructured":"Feynman, R.: Simulating physics with computers. Int. J. Of Theor. Phys. Vol. 21 No. 6\/7 (1982) 467\u2013488","journal-title":"Int. J. Of Theor. Phys."},{"key":"45_CR2","first-page":"96","volume":"A400","author":"D. Deutsch","year":"1989","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Royal Society London, A400, (1989) 96\u2013117","journal-title":"Proc. Royal Society London"},{"unstructured":"Gruska, J.: Quantum Computing, McGraw Hill (1999)","key":"45_CR3"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/PGEC.1966.264373","volume":"EC-15","author":"F. Hennie","year":"1966","unstructured":"Hennie, F.: On-line Turing machine computation. IEEE Trans. Electr. Comp., EC-15 (1966) 35\u201344","journal-title":"IEEE Trans. Electr. Comp."},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/321450.321464","volume":"15","author":"J. Hartmanis","year":"1968","unstructured":"Hartmanis, J.: Computational complexity of one-tape Turing machine computations. J. Assoc. Comput. Mach. 15 (1968) 325\u2013339","journal-title":"J. Assoc. Comput. Mach."},{"unstructured":"Freivalds, R.:Complexity of palindromes recognition by Turing machines with an input. \u201dAlgebra i Logika\u201d, v.4, No. 1 (1965) 47\u201358 (in Russian)","key":"45_CR6"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:21:14Z","timestamp":1550722874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}